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.r378-smll-171683810700084.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 itstools
Input is SieveSingleMsgMbox-PT-d1m64, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810700084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K 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-d1m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716912276131

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m64
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 16:04:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 16:04:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:04:38] [INFO ] Load time of PNML (sax parser for PT used): 450 ms
[2024-05-28 16:04:38] [INFO ] Transformed 1295 places.
[2024-05-28 16:04:38] [INFO ] Transformed 749 transitions.
[2024-05-28 16:04:38] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 651 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1036 places in 14 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 303 place count 196 transition count 391
Iterating global reduction 1 with 46 rules applied. Total rules applied 349 place count 196 transition count 391
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 355 place count 196 transition count 385
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 385 place count 166 transition count 355
Iterating global reduction 2 with 30 rules applied. Total rules applied 415 place count 166 transition count 355
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 432 place count 166 transition count 338
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 448 place count 150 transition count 320
Iterating global reduction 3 with 16 rules applied. Total rules applied 464 place count 150 transition count 320
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 516 place count 150 transition count 268
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 521 place count 145 transition count 260
Iterating global reduction 4 with 5 rules applied. Total rules applied 526 place count 145 transition count 260
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 531 place count 140 transition count 255
Iterating global reduction 4 with 5 rules applied. Total rules applied 536 place count 140 transition count 255
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 538 place count 138 transition count 253
Iterating global reduction 4 with 2 rules applied. Total rules applied 540 place count 138 transition count 253
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 541 place count 137 transition count 252
Iterating global reduction 4 with 1 rules applied. Total rules applied 542 place count 137 transition count 252
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 543 place count 136 transition count 251
Iterating global reduction 4 with 1 rules applied. Total rules applied 544 place count 136 transition count 251
Applied a total of 544 rules in 200 ms. Remains 136 /259 variables (removed 123) and now considering 251/749 (removed 498) transitions.
// Phase 1: matrix 251 rows 136 cols
[2024-05-28 16:04:39] [INFO ] Computed 5 invariants in 25 ms
[2024-05-28 16:04:40] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-28 16:04:40] [INFO ] Invariant cache hit.
[2024-05-28 16:04:40] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-05-28 16:04:40] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2024-05-28 16:04:40] [INFO ] Invariant cache hit.
[2024-05-28 16:04:40] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 1/136 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-28 16:04:46] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 29 ms to minimize.
[2024-05-28 16:04:46] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 251/387 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 158/301 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 301 constraints, problems are : Problem set: 0 solved, 250 unsolved in 17615 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 1/136 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 251/387 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 158/301 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 250/551 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-28 16:05:06] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 3 ms to minimize.
[2024-05-28 16:05:06] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 2/553 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 11 (OVERLAPS) 0/387 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 553 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 4/4 constraints]
After SMT, in 48443ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 48467ms
Starting structural reductions in LTL mode, iteration 1 : 136/259 places, 251/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49974 ms. Remains : 136/259 places, 251/749 transitions.
Support contains 23 out of 136 places after structural reductions.
[2024-05-28 16:05:29] [INFO ] Flatten gal took : 64 ms
[2024-05-28 16:05:29] [INFO ] Flatten gal took : 32 ms
[2024-05-28 16:05:29] [INFO ] Input system was already deterministic with 251 transitions.
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40000 steps (9025 resets) in 3059 ms. (13 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (193 resets) in 57 ms. (69 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (168 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (182 resets) in 65 ms. (60 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (198 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (189 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (195 resets) in 56 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (204 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (200 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (415 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (187 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (180 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (210 resets) in 44 ms. (88 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (177 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (188 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (204 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (174 resets) in 43 ms. (90 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (187 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (177 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (218 resets) in 44 ms. (88 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (176 resets) in 44 ms. (88 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (188 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (203 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (185 resets) in 43 ms. (90 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 214809 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :13 out of 23
Probabilistic random walk after 214809 steps, saw 101019 distinct states, run finished after 3009 ms. (steps per millisecond=71 ) properties seen :13
[2024-05-28 16:05:34] [INFO ] Invariant cache hit.
[2024-05-28 16:05:34] [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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 58/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 8/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 32/112 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-28 16:05:34] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 191/303 variables, 112/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 98/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 11 (OVERLAPS) 84/387 variables, 24/240 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 60/300 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/387 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 300 constraints, problems are : Problem set: 3 solved, 7 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 60/71 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 8/79 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 32/111 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 182/293 variables, 111/117 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 89/206 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 1/207 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 94/387 variables, 25/232 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 69/301 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 6/307 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-28 16:05:36] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 1/308 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/308 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/387 variables, 0/308 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 308 constraints, problems are : Problem set: 3 solved, 7 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 7/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 2950ms problems are : Problem set: 3 solved, 7 unsolved
Parikh walk visited 0 properties in 31231 ms.
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 251/251 transitions.
Graph (complete) has 462 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 135 transition count 249
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 126 transition count 189
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 126 transition count 189
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 117 transition count 180
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 117 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 117 transition count 178
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 46 place count 112 transition count 173
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 112 transition count 173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 112 transition count 170
Applied a total of 54 rules in 52 ms. Remains 112 /136 variables (removed 24) and now considering 170/251 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 112/136 places, 170/251 transitions.
RANDOM walk for 40000 steps (8939 resets) in 202 ms. (197 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1964 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1924 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (4054 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1890 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1952 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1890 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1944 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 355431 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 7
Probabilistic random walk after 355431 steps, saw 155488 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
// Phase 1: matrix 170 rows 112 cols
[2024-05-28 16:06:11] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 16:06:11] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 51/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 8/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 7/77 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 157/234 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 48/282 variables, 35/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 13/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/282 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 209 constraints, problems are : Problem set: 0 solved, 7 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 51/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 8/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 7/77 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 157/234 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 48/282 variables, 35/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 13/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 7/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 16:06:13] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/282 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 217 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1504 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 1988ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 31104 ms.
Support contains 11 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 170/170 transitions.
Applied a total of 0 rules in 16 ms. Remains 112 /112 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 112/112 places, 170/170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 170/170 transitions.
Applied a total of 0 rules in 10 ms. Remains 112 /112 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2024-05-28 16:06:45] [INFO ] Invariant cache hit.
[2024-05-28 16:06:45] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-28 16:06:45] [INFO ] Invariant cache hit.
[2024-05-28 16:06:45] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-28 16:06:45] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-05-28 16:06:45] [INFO ] Redundant transitions in 6 ms returned []
Running 169 sub problems to find dead transitions.
[2024-05-28 16:06:45] [INFO ] Invariant cache hit.
[2024-05-28 16:06:45] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/282 variables, 112/116 constraints. Problems are: Problem set: 0 solved, 169 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 93/209 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 209 constraints, problems are : Problem set: 0 solved, 169 unsolved in 6892 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/282 variables, 112/116 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 93/209 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 169/378 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-28 16:06:56] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 379 constraints, problems are : Problem set: 0 solved, 169 unsolved in 18191 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 1/1 constraints]
After SMT, in 25336ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 25339ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25822 ms. Remains : 112/112 places, 170/170 transitions.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 47 stable transitions
Graph (complete) has 514 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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((p0||X(X(X(G(p1)))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 160
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 108 transition count 146
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 108 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 108 transition count 141
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 98 transition count 131
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 98 transition count 131
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 96 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 94 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 93 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 91 transition count 117
Applied a total of 101 rules in 14 ms. Remains 91 /136 variables (removed 45) and now considering 117/251 (removed 134) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 16:07:11] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 16:07:11] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-28 16:07:11] [INFO ] Invariant cache hit.
[2024-05-28 16:07:11] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 16:07:11] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-28 16:07:11] [INFO ] Invariant cache hit.
[2024-05-28 16:07:11] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 16:07:12] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-28 16:07:13] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4896 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5919 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 10932ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 10934ms
Starting structural reductions in LTL mode, iteration 1 : 91/136 places, 117/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11308 ms. Remains : 91/136 places, 117/251 transitions.
Stuttering acceptance computed with spot in 381 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-01
Product exploration explored 100000 steps with 22423 reset in 484 ms.
Product exploration explored 100000 steps with 22433 reset in 429 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8976 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1923 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2212771 steps, run timeout after 3001 ms. (steps per millisecond=737 ) properties seen :0 out of 1
Probabilistic random walk after 2212771 steps, saw 983445 distinct states, run finished after 3001 ms. (steps per millisecond=737 ) properties seen :0
[2024-05-28 16:07:27] [INFO ] Invariant cache hit.
[2024-05-28 16:07:27] [INFO ] State equation strengthened by 58 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) 46/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/66 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/71 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/164 variables, 71/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/208 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 24/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 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) 46/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/66 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/71 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/164 variables, 71/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/208 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 24/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 464ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 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 90 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 89 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 105
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 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 87 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 87 transition count 103
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 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 86 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 86 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 85 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 85 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 84 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 84 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 83 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 83 transition count 96
Applied a total of 21 rules in 24 ms. Remains 83 /91 variables (removed 8) and now considering 96/117 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 83/91 places, 96/117 transitions.
RANDOM walk for 40000 steps (8972 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1912 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1119915 steps, run visited all 1 properties in 1215 ms. (steps per millisecond=921 )
Probabilistic random walk after 1119915 steps, saw 497329 distinct states, run finished after 1222 ms. (steps per millisecond=916 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 91 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-28 16:07:29] [INFO ] Invariant cache hit.
[2024-05-28 16:07:29] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 16:07:29] [INFO ] Invariant cache hit.
[2024-05-28 16:07:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 16:07:30] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-28 16:07:30] [INFO ] Invariant cache hit.
[2024-05-28 16:07:30] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 16:07:31] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:07:31] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5218 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5816 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 11202ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 11205ms
Finished structural reductions in LTL mode , in 1 iterations and 11614 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8982 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1899 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2498371 steps, run timeout after 3001 ms. (steps per millisecond=832 ) properties seen :0 out of 1
Probabilistic random walk after 2498371 steps, saw 1108920 distinct states, run finished after 3001 ms. (steps per millisecond=832 ) properties seen :0
[2024-05-28 16:07:44] [INFO ] Invariant cache hit.
[2024-05-28 16:07:44] [INFO ] State equation strengthened by 58 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) 46/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/66 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/71 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/164 variables, 71/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/208 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 24/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 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) 46/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/66 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/71 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/164 variables, 71/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/208 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 24/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 409ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 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 90 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 89 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 105
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 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 87 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 87 transition count 103
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 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 86 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 86 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 85 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 85 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 84 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 84 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 83 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 83 transition count 96
Applied a total of 21 rules in 21 ms. Remains 83 /91 variables (removed 8) and now considering 96/117 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 83/91 places, 96/117 transitions.
RANDOM walk for 40000 steps (8918 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1926 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1119915 steps, run visited all 1 properties in 1239 ms. (steps per millisecond=903 )
Probabilistic random walk after 1119915 steps, saw 497329 distinct states, run finished after 1239 ms. (steps per millisecond=903 ) properties seen :1
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 186 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 22469 reset in 122 ms.
Product exploration explored 100000 steps with 22388 reset in 133 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 105
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 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 87 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 87 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 86 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 86 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 85 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 85 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 84 transition count 98
Applied a total of 18 rules in 47 ms. Remains 84 /91 variables (removed 7) and now considering 98/117 (removed 19) transitions.
[2024-05-28 16:07:48] [INFO ] Redundant transitions in 3 ms returned []
Running 97 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 16:07:48] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 16:07:48] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 16:07:49] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-05-28 16:07:49] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3958 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4324 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 8415ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8417ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/91 places, 98/117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8474 ms. Remains : 84/91 places, 98/117 transitions.
Built C files in :
/tmp/ltsmin9195513834208524982
[2024-05-28 16:07:56] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9195513834208524982
Running compilation step : cd /tmp/ltsmin9195513834208524982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 653 ms.
Running link step : cd /tmp/ltsmin9195513834208524982;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin9195513834208524982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5855227839849863982.hoa' '--buchi-type=spotba'
LTSmin run took 1403 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 finished in 47517 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))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 151
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 106 transition count 130
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 77 place count 95 transition count 119
Iterating global reduction 1 with 11 rules applied. Total rules applied 88 place count 95 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 95 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 109
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 89 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 87 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 85 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 84 transition count 98
Applied a total of 119 rules in 36 ms. Remains 84 /136 variables (removed 52) and now considering 98/251 (removed 153) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 16:07:58] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 16:07:58] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-28 16:07:58] [INFO ] Invariant cache hit.
[2024-05-28 16:07:58] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 16:07:59] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-05-28 16:07:59] [INFO ] Redundant transitions in 2 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 16:07:59] [INFO ] Invariant cache hit.
[2024-05-28 16:07:59] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 16:08:00] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:08:00] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3914 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4382 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 8374ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8376ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/136 places, 98/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8725 ms. Remains : 84/136 places, 98/251 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 finished in 8781 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 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 151
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 106 transition count 130
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 77 place count 95 transition count 119
Iterating global reduction 1 with 11 rules applied. Total rules applied 88 place count 95 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 95 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 109
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 89 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 87 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 85 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 84 transition count 98
Applied a total of 119 rules in 13 ms. Remains 84 /136 variables (removed 52) and now considering 98/251 (removed 153) transitions.
[2024-05-28 16:08:07] [INFO ] Invariant cache hit.
[2024-05-28 16:08:07] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-28 16:08:07] [INFO ] Invariant cache hit.
[2024-05-28 16:08:07] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 16:08:07] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-28 16:08:07] [INFO ] Invariant cache hit.
[2024-05-28 16:08:07] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 16:08:08] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
[2024-05-28 16:08:08] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3950 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5660 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 9691ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9693ms
Starting structural reductions in LTL mode, iteration 1 : 84/136 places, 98/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10010 ms. Remains : 84/136 places, 98/251 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-05 finished in 10095 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(F(!p0))||(F(!p0)&&G(F(!p1)))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 153
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 153
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 108 transition count 139
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 108 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 62 place count 108 transition count 133
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 72 place count 98 transition count 123
Iterating global reduction 1 with 10 rules applied. Total rules applied 82 place count 98 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 89 place count 98 transition count 116
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 95 transition count 113
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 110
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 90 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 90 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 90 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 88 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 87 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 87 transition count 102
Applied a total of 113 rules in 12 ms. Remains 87 /136 variables (removed 49) and now considering 102/251 (removed 149) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-05-28 16:08:17] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 16:08:17] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-28 16:08:17] [INFO ] Invariant cache hit.
[2024-05-28 16:08:17] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 16:08:17] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-28 16:08:17] [INFO ] Invariant cache hit.
[2024-05-28 16:08:17] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 16:08:19] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:08:19] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 16:08:20] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5252 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 10374ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 10376ms
Starting structural reductions in LTL mode, iteration 1 : 87/136 places, 102/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10699 ms. Remains : 87/136 places, 102/251 transitions.
Stuttering acceptance computed with spot in 237 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
Product exploration explored 100000 steps with 22575 reset in 287 ms.
Product exploration explored 100000 steps with 22422 reset in 220 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (8918 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1919 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1828 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1907 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2487 steps, run visited all 3 properties in 30 ms. (steps per millisecond=82 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 30 ms. (steps per millisecond=82 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 68 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-28 16:08:29] [INFO ] Invariant cache hit.
[2024-05-28 16:08:29] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-28 16:08:29] [INFO ] Invariant cache hit.
[2024-05-28 16:08:29] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 16:08:30] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-28 16:08:30] [INFO ] Redundant transitions in 3 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-28 16:08:30] [INFO ] Invariant cache hit.
[2024-05-28 16:08:30] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 16:08:31] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 3 ms to minimize.
[2024-05-28 16:08:31] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 16:08:33] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5952 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5673 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 11768ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 11769ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12105 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (8957 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1949 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1895 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1971 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2487 steps, run visited all 3 properties in 27 ms. (steps per millisecond=92 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 28 ms. (steps per millisecond=88 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 79 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 68 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22354 reset in 124 ms.
Product exploration explored 100000 steps with 22518 reset in 224 ms.
Built C files in :
/tmp/ltsmin1279391831872670621
[2024-05-28 16:08:43] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-28 16:08:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:08:43] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-28 16:08:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:08:43] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-28 16:08:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:08:43] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1279391831872670621
Running compilation step : cd /tmp/ltsmin1279391831872670621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 449 ms.
Running link step : cd /tmp/ltsmin1279391831872670621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1279391831872670621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8026202319828051426.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-28 16:08:58] [INFO ] Invariant cache hit.
[2024-05-28 16:08:58] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 16:08:58] [INFO ] Invariant cache hit.
[2024-05-28 16:08:58] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 16:08:58] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-05-28 16:08:58] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-28 16:08:58] [INFO ] Invariant cache hit.
[2024-05-28 16:08:58] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 16:08:59] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:08:59] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 16:09:00] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4464 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4835 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 9389ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 9391ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9716 ms. Remains : 87/87 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin841003559059064838
[2024-05-28 16:09:07] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-28 16:09:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:09:07] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-28 16:09:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:09:07] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-28 16:09:07] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:09:07] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin841003559059064838
Running compilation step : cd /tmp/ltsmin841003559059064838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 388 ms.
Running link step : cd /tmp/ltsmin841003559059064838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin841003559059064838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7845288007473781028.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 16:09:23] [INFO ] Flatten gal took : 11 ms
[2024-05-28 16:09:23] [INFO ] Flatten gal took : 9 ms
[2024-05-28 16:09:23] [INFO ] Time to serialize gal into /tmp/LTL10876633763993965591.gal : 4 ms
[2024-05-28 16:09:23] [INFO ] Time to serialize properties into /tmp/LTL16051088872832282960.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10876633763993965591.gal' '-t' 'CGAL' '-hoa' '/tmp/aut784170447428747353.hoa' '-atoms' '/tmp/LTL16051088872832282960.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16051088872832282960.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut784170447428747353.hoa
Detected timeout of ITS tools.
[2024-05-28 16:09:38] [INFO ] Flatten gal took : 9 ms
[2024-05-28 16:09:38] [INFO ] Flatten gal took : 9 ms
[2024-05-28 16:09:38] [INFO ] Time to serialize gal into /tmp/LTL567884382328458369.gal : 2 ms
[2024-05-28 16:09:38] [INFO ] Time to serialize properties into /tmp/LTL8289758549346606880.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL567884382328458369.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8289758549346606880.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((s1<1)||(l1191<1))")))||((F("((s1<1)||(l1191<1))"))&&(G(F("(((s1<1)||(l354<1))||((s1<1)||(l1191<1)))"))))))))
Formula 0 simplified : XX(FG!"((s1<1)||(l1191<1))" & (G!"((s1<1)||(l1191<1))" | FG!"(((s1<1)||(l354<1))||((s1<1)||(l1191<1)))"))
Detected timeout of ITS tools.
[2024-05-28 16:09:53] [INFO ] Flatten gal took : 9 ms
[2024-05-28 16:09:53] [INFO ] Applying decomposition
[2024-05-28 16:09:53] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9523444866810635250.txt' '-o' '/tmp/graph9523444866810635250.bin' '-w' '/tmp/graph9523444866810635250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9523444866810635250.bin' '-l' '-1' '-v' '-w' '/tmp/graph9523444866810635250.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:09:53] [INFO ] Decomposing Gal with order
[2024-05-28 16:09:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:09:53] [INFO ] Removed a total of 92 redundant transitions.
[2024-05-28 16:09:53] [INFO ] Flatten gal took : 93 ms
[2024-05-28 16:09:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 21 ms.
[2024-05-28 16:09:53] [INFO ] Time to serialize gal into /tmp/LTL2890268203704192841.gal : 8 ms
[2024-05-28 16:09:53] [INFO ] Time to serialize properties into /tmp/LTL4770466524235527176.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2890268203704192841.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4770466524235527176.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((i2.u0.s1<1)||(u16.l1191<1))")))||((F("((i2.u0.s1<1)||(u16.l1191<1))"))&&(G(F("(((i2.u0.s1<1)||(i3.u12.l354<1))||((i2.u0...187
Formula 0 simplified : XX(FG!"((i2.u0.s1<1)||(u16.l1191<1))" & (G!"((i2.u0.s1<1)||(u16.l1191<1))" | FG!"(((i2.u0.s1<1)||(i3.u12.l354<1))||((i2.u0.s1<1)||(u...171
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 finished in 111043 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(G((p0||X(p1)))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 120 transition count 142
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 120 transition count 142
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 47 place count 105 transition count 127
Iterating global reduction 0 with 15 rules applied. Total rules applied 62 place count 105 transition count 127
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 69 place count 105 transition count 120
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 79 place count 95 transition count 110
Iterating global reduction 1 with 10 rules applied. Total rules applied 89 place count 95 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 95 place count 95 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 93 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 93 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 91 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 91 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 90 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 90 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 90 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 89 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 89 transition count 97
Applied a total of 108 rules in 11 ms. Remains 89 /136 variables (removed 47) and now considering 97/251 (removed 154) transitions.
// Phase 1: matrix 97 rows 89 cols
[2024-05-28 16:10:08] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 16:10:08] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-28 16:10:08] [INFO ] Invariant cache hit.
[2024-05-28 16:10:08] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 16:10:09] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-28 16:10:09] [INFO ] Invariant cache hit.
[2024-05-28 16:10:09] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 16:10:10] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 3 ms to minimize.
[2024-05-28 16:10:10] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/186 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 39/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3765 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/186 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 39/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 96/231 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 16:10:14] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 232 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6425 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints]
After SMT, in 10311ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 10313ms
Starting structural reductions in LTL mode, iteration 1 : 89/136 places, 97/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10704 ms. Remains : 89/136 places, 97/251 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 finished in 10865 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((G(p0)||(!p0 U (p1||G(!p0))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 151
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 106 transition count 130
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 76 place count 96 transition count 120
Iterating global reduction 1 with 10 rules applied. Total rules applied 86 place count 96 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 92 place count 96 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 94 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 94 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 92 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 92 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 91 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 91 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 90 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 90 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 89 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 89 transition count 106
Applied a total of 106 rules in 15 ms. Remains 89 /136 variables (removed 47) and now considering 106/251 (removed 145) transitions.
// Phase 1: matrix 106 rows 89 cols
[2024-05-28 16:10:19] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 16:10:19] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-28 16:10:19] [INFO ] Invariant cache hit.
[2024-05-28 16:10:19] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 16:10:19] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-28 16:10:19] [INFO ] Invariant cache hit.
[2024-05-28 16:10:19] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 16:10:21] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:10:21] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/195 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 145 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4168 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/195 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 105/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 250 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6576 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 2/2 constraints]
After SMT, in 10834ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 10835ms
Starting structural reductions in LTL mode, iteration 1 : 89/136 places, 106/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11193 ms. Remains : 89/136 places, 106/251 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, false, false, (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Product exploration explored 100000 steps with 50000 reset in 303 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 286 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 14 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 finished in 11964 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||X((F(p0) U p1))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 144
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 144
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 129
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 129
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 67 place count 106 transition count 122
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 77 place count 96 transition count 112
Iterating global reduction 1 with 10 rules applied. Total rules applied 87 place count 96 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 93 place count 96 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 94 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 94 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 92 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 92 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 91 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 91 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 91 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 90 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 90 transition count 99
Applied a total of 106 rules in 10 ms. Remains 90 /136 variables (removed 46) and now considering 99/251 (removed 152) transitions.
// Phase 1: matrix 99 rows 90 cols
[2024-05-28 16:10:31] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 16:10:31] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 16:10:31] [INFO ] Invariant cache hit.
[2024-05-28 16:10:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 16:10:31] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 16:10:31] [INFO ] Invariant cache hit.
[2024-05-28 16:10:31] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 16:10:33] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:10:33] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/189 variables, 90/97 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 138 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4581 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/189 variables, 90/97 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 98/236 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 16:10:38] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 237 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6271 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 3/3 constraints]
After SMT, in 10937ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 10939ms
Starting structural reductions in LTL mode, iteration 1 : 90/136 places, 99/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11267 ms. Remains : 90/136 places, 99/251 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 finished in 11388 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) U p1) U X((!p2||(p3 U p1))))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 169
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 169
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 110 transition count 156
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 110 transition count 156
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 110 transition count 151
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 101 transition count 142
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 101 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 81 place count 101 transition count 136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 99 transition count 134
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 99 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 97 transition count 132
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 97 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 96 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 96 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 95 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 95 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 94 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 94 transition count 128
Applied a total of 95 rules in 11 ms. Remains 94 /136 variables (removed 42) and now considering 128/251 (removed 123) transitions.
// Phase 1: matrix 128 rows 94 cols
[2024-05-28 16:10:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 16:10:42] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 16:10:42] [INFO ] Invariant cache hit.
[2024-05-28 16:10:43] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 16:10:43] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-05-28 16:10:43] [INFO ] Invariant cache hit.
[2024-05-28 16:10:43] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 16:10:44] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:10:44] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 128/222 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 67/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 168 constraints, problems are : Problem set: 0 solved, 127 unsolved in 6717 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 128/222 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 67/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 127/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 295 constraints, problems are : Problem set: 0 solved, 127 unsolved in 6512 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 2/2 constraints]
After SMT, in 13340ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 13342ms
Starting structural reductions in LTL mode, iteration 1 : 94/136 places, 128/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13734 ms. Remains : 94/136 places, 128/251 transitions.
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-11
Product exploration explored 100000 steps with 41538 reset in 201 ms.
Product exploration explored 100000 steps with 41608 reset in 212 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 316 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 209 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8970 resets) in 390 ms. (102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1946 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1933 resets) in 148 ms. (268 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1938 resets) in 376 ms. (106 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1943 resets) in 350 ms. (113 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1925 resets) in 322 ms. (123 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (2000 resets) in 237 ms. (168 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1901 resets) in 208 ms. (191 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1906 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1931 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1900 resets) in 211 ms. (188 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (2002 resets) in 176 ms. (226 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1915 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 278734 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :7 out of 12
Probabilistic random walk after 278734 steps, saw 128380 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :7
[2024-05-28 16:11:02] [INFO ] Invariant cache hit.
[2024-05-28 16:11:02] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/75 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 113/188 variables, 75/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 52/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf5 is UNSAT
At refinement iteration 10 (OVERLAPS) 34/222 variables, 19/151 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 15/166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 166 constraints, problems are : Problem set: 1 solved, 4 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 20/75 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 113/188 variables, 75/80 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 52/132 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 34/222 variables, 19/151 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 15/166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 4/170 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 170 constraints, problems are : Problem set: 1 solved, 4 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 801ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2388 ms.
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 128/128 transitions.
Graph (complete) has 281 edges and 94 vertex of which 93 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 93 transition count 126
Applied a total of 3 rules in 5 ms. Remains 93 /94 variables (removed 1) and now considering 126/128 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 93/94 places, 126/128 transitions.
RANDOM walk for 40000 steps (8946 resets) in 271 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1899 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1863 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1860 resets) in 72 ms. (548 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1940 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 289510 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 4
Probabilistic random walk after 289510 steps, saw 133392 distinct states, run finished after 3002 ms. (steps per millisecond=96 ) properties seen :0
// Phase 1: matrix 126 rows 93 cols
[2024-05-28 16:11:08] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 16:11:08] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/61 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 113/174 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 52/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 45/219 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 13/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/219 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 162 constraints, problems are : Problem set: 0 solved, 4 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/61 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 113/174 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 52/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 45/219 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 13/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/219 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 166 constraints, problems are : Problem set: 0 solved, 4 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 839ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1367 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 93/93 places, 126/126 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 7 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 16:11:11] [INFO ] Invariant cache hit.
[2024-05-28 16:11:11] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 16:11:11] [INFO ] Invariant cache hit.
[2024-05-28 16:11:11] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 16:11:11] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-28 16:11:11] [INFO ] Redundant transitions in 1 ms returned []
Running 125 sub problems to find dead transitions.
[2024-05-28 16:11:11] [INFO ] Invariant cache hit.
[2024-05-28 16:11:11] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/219 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 162 constraints, problems are : Problem set: 0 solved, 125 unsolved in 4855 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/219 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 125/287 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 287 constraints, problems are : Problem set: 0 solved, 125 unsolved in 7373 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 12431ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 12434ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12812 ms. Remains : 93/93 places, 126/126 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 93 transition count 120
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 88 transition count 120
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 88 transition count 107
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 75 transition count 107
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 53 place count 67 transition count 99
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 67 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 66 transition count 98
Applied a total of 55 rules in 31 ms. Remains 66 /93 variables (removed 27) and now considering 98/126 (removed 28) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 98 rows 66 cols
[2024-05-28 16:11:23] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 16:11:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 16:11:23] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 16:11:24] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 16:11:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 16:11:24] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 16:11:24] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-28 16:11:24] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-28 16:11:24] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 576 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p1 (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (OR p1 (NOT p3)))), (F p3), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 22 factoid took 517 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Support contains 4 out of 94 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 94 cols
[2024-05-28 16:11:25] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 16:11:25] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-28 16:11:25] [INFO ] Invariant cache hit.
[2024-05-28 16:11:25] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 16:11:26] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-05-28 16:11:26] [INFO ] Invariant cache hit.
[2024-05-28 16:11:26] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 16:11:27] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:11:27] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 128/222 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 67/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 168 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5558 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 128/222 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 67/168 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 127/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 295 constraints, problems are : Problem set: 0 solved, 127 unsolved in 6479 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 2/2 constraints]
After SMT, in 12213ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 12216ms
Finished structural reductions in LTL mode , in 1 iterations and 12730 ms. Remains : 94/94 places, 128/128 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 316 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 149 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8981 resets) in 396 ms. (100 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1960 resets) in 248 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1871 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1964 resets) in 241 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1970 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 205 ms. (194 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1881 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 439202 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :3 out of 6
Probabilistic random walk after 439202 steps, saw 202254 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :3
[2024-05-28 16:11:42] [INFO ] Invariant cache hit.
[2024-05-28 16:11:42] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/74 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 104/178 variables, 74/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 43/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 44/222 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 166 constraints, problems are : Problem set: 0 solved, 3 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/74 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 104/178 variables, 74/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 43/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 44/222 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 169 constraints, problems are : Problem set: 0 solved, 3 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 661ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 10166 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 128/128 transitions.
Graph (complete) has 281 edges and 94 vertex of which 93 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 93 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 92 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 92 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 91 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 91 transition count 116
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 91 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 114
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 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 88 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 88 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 87 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 87 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 20 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 21 place count 86 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 86 transition count 106
Applied a total of 22 rules in 19 ms. Remains 86 /94 variables (removed 8) and now considering 106/128 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 86/94 places, 106/128 transitions.
RANDOM walk for 40000 steps (8905 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1959 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1896 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1896 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 427982 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 3
Probabilistic random walk after 427982 steps, saw 194329 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
// Phase 1: matrix 106 rows 86 cols
[2024-05-28 16:11:56] [INFO ] Computed 4 invariants in 5 ms
[2024-05-28 16:11:56] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 95/153 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 39/192 variables, 28/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 140 constraints, problems are : Problem set: 0 solved, 3 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 50/50 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 95/153 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 39/192 variables, 28/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/192 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 143 constraints, problems are : Problem set: 0 solved, 3 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 607ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3285 ms.
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 86/86 places, 106/106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2024-05-28 16:12:00] [INFO ] Invariant cache hit.
[2024-05-28 16:12:00] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-28 16:12:00] [INFO ] Invariant cache hit.
[2024-05-28 16:12:00] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-28 16:12:00] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-05-28 16:12:00] [INFO ] Redundant transitions in 0 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-28 16:12:00] [INFO ] Invariant cache hit.
[2024-05-28 16:12:00] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/192 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 50/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 140 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4561 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/192 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 50/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 105/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 245 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5258 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 9904ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 9906ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10326 ms. Remains : 86/86 places, 106/106 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 86 transition count 100
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 81 transition count 100
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 11 place count 81 transition count 86
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 39 place count 67 transition count 86
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 49 place count 62 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 62 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 61 transition count 80
Applied a total of 51 rules in 9 ms. Remains 61 /86 variables (removed 25) and now considering 80/106 (removed 26) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 80 rows 61 cols
[2024-05-28 16:12:10] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 16:12:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 16:12:10] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 16:12:10] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 16:12:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 16:12:10] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 16:12:10] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 16:12:10] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 16:12:10] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 328 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 358 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 41714 reset in 304 ms.
Product exploration explored 100000 steps with 41607 reset in 315 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 128/128 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 92 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 92 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 91 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 91 transition count 116
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 91 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 89 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 88 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 88 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 88 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 87 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 87 transition count 108
Applied a total of 19 rules in 20 ms. Remains 87 /94 variables (removed 7) and now considering 108/128 (removed 20) transitions.
[2024-05-28 16:12:12] [INFO ] Redundant transitions in 1 ms returned []
Running 107 sub problems to find dead transitions.
// Phase 1: matrix 108 rows 87 cols
[2024-05-28 16:12:12] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 16:12:12] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/195 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 52/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 146 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5729 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/195 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 52/146 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 107/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 253 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5380 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
After SMT, in 11258ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 11261ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/94 places, 108/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11288 ms. Remains : 87/94 places, 108/128 transitions.
Built C files in :
/tmp/ltsmin15701880079645694018
[2024-05-28 16:12:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15701880079645694018
Running compilation step : cd /tmp/ltsmin15701880079645694018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 658 ms.
Running link step : cd /tmp/ltsmin15701880079645694018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin15701880079645694018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11980037775618809329.hoa' '--buchi-type=spotba'
LTSmin run took 12529 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 finished in 114601 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(!p0))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 151
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 106 transition count 130
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 77 place count 95 transition count 119
Iterating global reduction 1 with 11 rules applied. Total rules applied 88 place count 95 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 95 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 109
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 89 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 87 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 85 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 84 transition count 98
Applied a total of 119 rules in 19 ms. Remains 84 /136 variables (removed 52) and now considering 98/251 (removed 153) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 16:12:37] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 16:12:37] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-28 16:12:37] [INFO ] Invariant cache hit.
[2024-05-28 16:12:37] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 16:12:37] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2024-05-28 16:12:38] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 16:12:38] [INFO ] Invariant cache hit.
[2024-05-28 16:12:38] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 16:12:39] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:12:39] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3514 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5275 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 8871ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8873ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/136 places, 98/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9416 ms. Remains : 84/136 places, 98/251 transitions.
Stuttering acceptance computed with spot in 36 ms :[false]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-12
Product exploration explored 100000 steps with 22452 reset in 125 ms.
Product exploration explored 100000 steps with 22480 reset in 269 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[false]
RANDOM walk for 40000 steps (8984 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 36123 steps, run visited all 1 properties in 50 ms. (steps per millisecond=722 )
Probabilistic random walk after 36123 steps, saw 16035 distinct states, run finished after 51 ms. (steps per millisecond=708 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[false]
Stuttering acceptance computed with spot in 54 ms :[false]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 16:12:47] [INFO ] Invariant cache hit.
[2024-05-28 16:12:47] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 16:12:47] [INFO ] Invariant cache hit.
[2024-05-28 16:12:47] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 16:12:48] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-28 16:12:48] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 16:12:48] [INFO ] Invariant cache hit.
[2024-05-28 16:12:48] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 16:12:49] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
[2024-05-28 16:12:49] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 135 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3762 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 97/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4789 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 8628ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8629ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8963 ms. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[false]
RANDOM walk for 40000 steps (8974 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1926 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 36123 steps, run visited all 1 properties in 82 ms. (steps per millisecond=440 )
Probabilistic random walk after 36123 steps, saw 16035 distinct states, run finished after 82 ms. (steps per millisecond=440 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[false]
Stuttering acceptance computed with spot in 37 ms :[false]
Stuttering acceptance computed with spot in 38 ms :[false]
Product exploration explored 100000 steps with 22431 reset in 185 ms.
Product exploration explored 100000 steps with 22431 reset in 242 ms.
Built C files in :
/tmp/ltsmin11058293403555817945
[2024-05-28 16:12:57] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-28 16:12:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:12:57] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-28 16:12:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:12:57] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-28 16:12:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:12:57] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11058293403555817945
Running compilation step : cd /tmp/ltsmin11058293403555817945;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 628 ms.
Running link step : cd /tmp/ltsmin11058293403555817945;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11058293403555817945;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6457651018651310313.hoa' '--buchi-type=spotba'
LTSmin run took 5512 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 finished in 26386 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&&((!p2 U (p3||G(!p2)))||p1)))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 162
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 110 transition count 149
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 110 transition count 149
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 110 transition count 144
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 65 place count 102 transition count 136
Iterating global reduction 1 with 8 rules applied. Total rules applied 73 place count 102 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 77 place count 102 transition count 132
Applied a total of 77 rules in 10 ms. Remains 102 /136 variables (removed 34) and now considering 132/251 (removed 119) transitions.
// Phase 1: matrix 132 rows 102 cols
[2024-05-28 16:13:03] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 16:13:03] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-28 16:13:03] [INFO ] Invariant cache hit.
[2024-05-28 16:13:04] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 16:13:04] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-05-28 16:13:04] [INFO ] Redundant transitions in 1 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-28 16:13:04] [INFO ] Invariant cache hit.
[2024-05-28 16:13:04] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 16:13:06] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:13:06] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/234 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 65/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 16:13:10] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/234 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 175 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8785 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/234 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 65/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 131/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 306 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8163 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
After SMT, in 17156ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 17159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/136 places, 132/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17632 ms. Remains : 102/136 places, 132/251 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-13
Product exploration explored 100000 steps with 22426 reset in 227 ms.
Product exploration explored 100000 steps with 22471 reset in 245 ms.
Computed a total of 18 stabilizing places and 24 stable transitions
Graph (complete) has 337 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p3 p0 p1 (NOT p2)), (X (NOT p2)), (X p3), (X (AND p3 p0)), (X (NOT (OR (AND (NOT p3) p2) (NOT p0)))), (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (OR (AND p3 p0) (AND p1 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (AND p3 p0))), (X (X (NOT (OR (AND (NOT p3) p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0)))), (X (X (OR (AND p3 p0) (AND p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 132 ms. Reduced automaton from 2 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
RANDOM walk for 40000 steps (8954 resets) in 716 ms. (55 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1962 resets) in 140 ms. (283 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1939 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1906 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1885 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1979 resets) in 189 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1901 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1888 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1961 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1923 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1872 resets) in 148 ms. (268 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 279632 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :6 out of 10
Probabilistic random walk after 279632 steps, saw 122483 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :6
[2024-05-28 16:13:26] [INFO ] Invariant cache hit.
[2024-05-28 16:13:26] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/83 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/200 variables, 83/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 34/234 variables, 19/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/83 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/200 variables, 83/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 34/234 variables, 19/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 16:13:26] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/234 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 177 constraints, problems are : Problem set: 0 solved, 4 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 986ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 36688 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 132/132 transitions.
Graph (complete) has 299 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 130
Applied a total of 3 rules in 8 ms. Remains 101 /102 variables (removed 1) and now considering 130/132 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 101/102 places, 130/132 transitions.
RANDOM walk for 40000 steps (8968 resets) in 377 ms. (105 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1863 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1919 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1956 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 295076 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 4
Probabilistic random walk after 295076 steps, saw 129353 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
// Phase 1: matrix 130 rows 101 cols
[2024-05-28 16:14:07] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 16:14:07] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 7/69 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/186 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 50/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 45/231 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/231 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 168 constraints, problems are : Problem set: 0 solved, 4 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 7/69 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/186 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 50/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 45/231 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/231 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 973ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9438 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 130/130 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 101/101 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 130/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-28 16:14:17] [INFO ] Invariant cache hit.
[2024-05-28 16:14:17] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 16:14:17] [INFO ] Invariant cache hit.
[2024-05-28 16:14:17] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 16:14:18] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-05-28 16:14:18] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-28 16:14:18] [INFO ] Invariant cache hit.
[2024-05-28 16:14:18] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 130/231 variables, 101/105 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 63/168 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-28 16:14:21] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/231 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 169 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7205 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 130/231 variables, 101/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 63/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 129/298 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 298 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8231 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
After SMT, in 15570ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 15572ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15971 ms. Remains : 101/101 places, 130/130 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 101 transition count 124
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 96 transition count 124
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 96 transition count 111
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 83 transition count 111
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 72 transition count 100
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 72 transition count 100
Applied a total of 60 rules in 23 ms. Remains 72 /101 variables (removed 29) and now considering 100/130 (removed 30) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 100 rows 72 cols
[2024-05-28 16:14:33] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 16:14:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 16:14:33] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 16:14:33] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 16:14:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 16:14:34] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 16:14:34] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-28 16:14:34] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:14:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
TRAPS : Iteration 1
[2024-05-28 16:14:34] [INFO ] After 420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-28 16:14:34] [INFO ] After 555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 837 ms.
Knowledge obtained : [(AND p3 p0 p1 (NOT p2)), (X (NOT p2)), (X p3), (X (AND p3 p0)), (X (NOT (OR (AND (NOT p3) p2) (NOT p0)))), (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (OR (AND p3 p0) (AND p1 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (AND p3 p0))), (X (X (NOT (OR (AND (NOT p3) p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0)))), (X (X (OR (AND p3 p0) (AND p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p3))), (F (NOT (OR (NOT p0) p3 p2))), (F p2), (F (NOT (AND p0 (OR p3 (NOT p2))))), (F (NOT p3)), (F (NOT p1))]
Knowledge based reduction with 21 factoid took 506 ms. Reduced automaton from 2 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 132/132 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 102 cols
[2024-05-28 16:14:35] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 16:14:35] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 16:14:35] [INFO ] Invariant cache hit.
[2024-05-28 16:14:35] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 16:14:35] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-28 16:14:35] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-28 16:14:35] [INFO ] Invariant cache hit.
[2024-05-28 16:14:35] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 16:14:37] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:14:37] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/234 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 65/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 16:14:40] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/234 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 175 constraints, problems are : Problem set: 0 solved, 131 unsolved in 7755 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/234 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 65/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 131/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 306 constraints, problems are : Problem set: 0 solved, 131 unsolved in 7422 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
After SMT, in 15311ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 15314ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15786 ms. Remains : 102/102 places, 132/132 transitions.
Computed a total of 18 stabilizing places and 24 stable transitions
Graph (complete) has 337 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 18 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p3 p1 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (OR (NOT p0) (AND (NOT p3) p2)))), (X (OR (AND p0 p3) (AND p0 p1))), (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p1) p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (AND p0 p3)), (X p0), (X p1), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (OR (NOT p0) (AND (NOT p3) p2))))), (X (X (OR (AND p0 p3) (AND p0 p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p1) p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (AND p0 p3))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 161 ms. Reduced automaton from 2 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
RANDOM walk for 40000 steps (8970 resets) in 614 ms. (65 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1952 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1894 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1932 resets) in 172 ms. (231 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1903 resets) in 251 ms. (158 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1870 resets) in 190 ms. (209 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1927 resets) in 257 ms. (155 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1939 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1862 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1897 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 202 ms. (197 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 298386 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :6 out of 10
Probabilistic random walk after 298386 steps, saw 131020 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :6
[2024-05-28 16:14:55] [INFO ] Invariant cache hit.
[2024-05-28 16:14:55] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/83 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/200 variables, 83/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 34/234 variables, 19/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/83 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/200 variables, 83/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 50/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 34/234 variables, 19/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 16:14:56] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/234 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 177 constraints, problems are : Problem set: 0 solved, 4 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1051ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 31729 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 132/132 transitions.
Graph (complete) has 299 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 130
Applied a total of 3 rules in 5 ms. Remains 101 /102 variables (removed 1) and now considering 130/132 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 101/102 places, 130/132 transitions.
RANDOM walk for 40000 steps (8957 resets) in 467 ms. (85 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1896 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1996 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1879 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 266540 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 4
Probabilistic random walk after 266540 steps, saw 117063 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 130 rows 101 cols
[2024-05-28 16:15:31] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 16:15:31] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 7/69 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/186 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 50/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 45/231 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/231 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 168 constraints, problems are : Problem set: 0 solved, 4 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 7/69 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 117/186 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 50/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 45/231 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/231 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1011ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9532 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 101/101 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 130/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-28 16:15:42] [INFO ] Invariant cache hit.
[2024-05-28 16:15:42] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-28 16:15:42] [INFO ] Invariant cache hit.
[2024-05-28 16:15:42] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 16:15:42] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-05-28 16:15:42] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-28 16:15:42] [INFO ] Invariant cache hit.
[2024-05-28 16:15:42] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 130/231 variables, 101/105 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 63/168 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-28 16:15:47] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/231 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 169 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7856 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 130/231 variables, 101/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 63/169 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 129/298 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 298 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8491 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
After SMT, in 16473ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 16474ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16857 ms. Remains : 101/101 places, 130/130 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 101 transition count 124
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 96 transition count 124
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 96 transition count 111
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 83 transition count 111
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 72 transition count 100
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 72 transition count 100
Applied a total of 60 rules in 10 ms. Remains 72 /101 variables (removed 29) and now considering 100/130 (removed 30) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 100 rows 72 cols
[2024-05-28 16:15:59] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 16:15:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 16:15:59] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 16:15:59] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 16:15:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 16:15:59] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 16:15:59] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-28 16:15:59] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-28 16:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 1
[2024-05-28 16:15:59] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-28 16:15:59] [INFO ] After 490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 669 ms.
Knowledge obtained : [(AND p0 p3 p1 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (OR (NOT p0) (AND (NOT p3) p2)))), (X (OR (AND p0 p3) (AND p0 p1))), (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p1) p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (AND p0 p3)), (X p0), (X p1), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (OR (NOT p0) (AND (NOT p3) p2))))), (X (X (OR (AND p0 p3) (AND p0 p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p1) p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (AND p0 p3))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p0 p3))), (F (NOT (OR (NOT p0) p3 p2))), (F p2), (F (NOT (AND p0 (OR p3 (NOT p2))))), (F (NOT p3)), (F (NOT p1))]
Knowledge based reduction with 21 factoid took 298 ms. Reduced automaton from 2 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Product exploration explored 100000 steps with 22550 reset in 224 ms.
Product exploration explored 100000 steps with 22430 reset in 233 ms.
Built C files in :
/tmp/ltsmin12794346925679716550
[2024-05-28 16:16:00] [INFO ] Computing symmetric may disable matrix : 132 transitions.
[2024-05-28 16:16:00] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:16:00] [INFO ] Computing symmetric may enable matrix : 132 transitions.
[2024-05-28 16:16:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:16:00] [INFO ] Computing Do-Not-Accords matrix : 132 transitions.
[2024-05-28 16:16:00] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:16:00] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12794346925679716550
Running compilation step : cd /tmp/ltsmin12794346925679716550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 538 ms.
Running link step : cd /tmp/ltsmin12794346925679716550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12794346925679716550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7203594425262610611.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 132/132 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 102 cols
[2024-05-28 16:16:15] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 16:16:15] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-28 16:16:15] [INFO ] Invariant cache hit.
[2024-05-28 16:16:16] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 16:16:16] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-28 16:16:16] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-28 16:16:16] [INFO ] Invariant cache hit.
[2024-05-28 16:16:16] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 16:16:18] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:16:18] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/234 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 65/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 16:16:21] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/234 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 175 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8540 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/234 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 65/175 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 131/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 306 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
After SMT, in 16761ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 16764ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17262 ms. Remains : 102/102 places, 132/132 transitions.
Built C files in :
/tmp/ltsmin3411044876524997078
[2024-05-28 16:16:33] [INFO ] Computing symmetric may disable matrix : 132 transitions.
[2024-05-28 16:16:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:16:33] [INFO ] Computing symmetric may enable matrix : 132 transitions.
[2024-05-28 16:16:33] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:16:33] [INFO ] Computing Do-Not-Accords matrix : 132 transitions.
[2024-05-28 16:16:33] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:16:33] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3411044876524997078
Running compilation step : cd /tmp/ltsmin3411044876524997078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 545 ms.
Running link step : cd /tmp/ltsmin3411044876524997078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3411044876524997078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1821842579761576259.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 16:16:48] [INFO ] Flatten gal took : 10 ms
[2024-05-28 16:16:48] [INFO ] Flatten gal took : 9 ms
[2024-05-28 16:16:48] [INFO ] Time to serialize gal into /tmp/LTL7230266473117585178.gal : 3 ms
[2024-05-28 16:16:48] [INFO ] Time to serialize properties into /tmp/LTL7684466763680680486.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7230266473117585178.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7194496632111732420.hoa' '-atoms' '/tmp/LTL7684466763680680486.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7684466763680680486.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7194496632111732420.hoa
Detected timeout of ITS tools.
[2024-05-28 16:17:03] [INFO ] Flatten gal took : 9 ms
[2024-05-28 16:17:03] [INFO ] Flatten gal took : 9 ms
[2024-05-28 16:17:03] [INFO ] Time to serialize gal into /tmp/LTL15147924104454723143.gal : 2 ms
[2024-05-28 16:17:03] [INFO ] Time to serialize properties into /tmp/LTL9263751969186671886.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15147924104454723143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9263751969186671886.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((s1<1)||(l960<1))||(((s1<1)||(l1195<1))&&((s1<1)||(l159<1))))")&&(("((s1<1)||(l960<1))")||((!("((s1>=1)&&(l1195>=1))"))U(("...249
Formula 0 simplified : GF(!"(((s1<1)||(l960<1))||(((s1<1)||(l1195<1))&&((s1<1)||(l159<1))))" | (!"((s1<1)||(l960<1))" & ("((s1>=1)&&(l1195>=1))" M !"((!((s...205
Detected timeout of ITS tools.
[2024-05-28 16:17:18] [INFO ] Flatten gal took : 10 ms
[2024-05-28 16:17:18] [INFO ] Applying decomposition
[2024-05-28 16:17:18] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15035584007908984423.txt' '-o' '/tmp/graph15035584007908984423.bin' '-w' '/tmp/graph15035584007908984423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15035584007908984423.bin' '-l' '-1' '-v' '-w' '/tmp/graph15035584007908984423.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:17:18] [INFO ] Decomposing Gal with order
[2024-05-28 16:17:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:17:18] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-28 16:17:18] [INFO ] Flatten gal took : 24 ms
[2024-05-28 16:17:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 6 ms.
[2024-05-28 16:17:18] [INFO ] Time to serialize gal into /tmp/LTL13360332053124086935.gal : 4 ms
[2024-05-28 16:17:18] [INFO ] Time to serialize properties into /tmp/LTL15649535159400319637.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13360332053124086935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15649535159400319637.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((i0.u0.s1<1)||(i0.u15.l960<1))||(((i0.u0.s1<1)||(u17.l1195<1))&&((i0.u0.s1<1)||(i3.u8.l159<1))))")&&(("((i0.u0.s1<1)||(i0.u...337
Formula 0 simplified : GF(!"(((i0.u0.s1<1)||(i0.u15.l960<1))||(((i0.u0.s1<1)||(u17.l1195<1))&&((i0.u0.s1<1)||(i3.u8.l159<1))))" | (!"((i0.u0.s1<1)||(i0.u15...283
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 finished in 269747 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&&F(!p1)) U (G((!p0&&F(!p1)))||(!p0&&G(!p1)))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 160
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 108 transition count 146
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 108 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 108 transition count 141
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 98 transition count 131
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 98 transition count 131
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 96 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 94 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 93 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 91 transition count 117
Applied a total of 101 rules in 13 ms. Remains 91 /136 variables (removed 45) and now considering 117/251 (removed 134) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 16:17:33] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 16:17:33] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-28 16:17:33] [INFO ] Invariant cache hit.
[2024-05-28 16:17:33] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 16:17:33] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-28 16:17:33] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-28 16:17:33] [INFO ] Invariant cache hit.
[2024-05-28 16:17:33] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 16:17:35] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 2 ms to minimize.
[2024-05-28 16:17:35] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5954 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7131 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 13205ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 13206ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/136 places, 117/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13592 ms. Remains : 91/136 places, 117/251 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-14
Product exploration explored 100000 steps with 22376 reset in 156 ms.
Product exploration explored 100000 steps with 22403 reset in 168 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 167 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8936 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1921 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1964 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1910 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1841 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1949 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1975 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 411479 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :3 out of 6
Probabilistic random walk after 411479 steps, saw 177373 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :3
[2024-05-28 16:17:51] [INFO ] Invariant cache hit.
[2024-05-28 16:17:51] [INFO ] State equation strengthened by 58 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) 46/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/72 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 102/174 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 43/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 10 (OVERLAPS) 34/208 variables, 19/139 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 15/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 154 constraints, problems are : Problem set: 1 solved, 2 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 16:17:51] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/72 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 102/174 variables, 72/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 43/121 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 34/208 variables, 19/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 15/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 2/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/208 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 157 constraints, problems are : Problem set: 1 solved, 2 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 719ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 415 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 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 90 transition count 115
Applied a total of 3 rules in 3 ms. Remains 90 /91 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/91 places, 115/117 transitions.
RANDOM walk for 40000 steps (8964 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1946 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1915 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 576778 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 2
Probabilistic random walk after 576778 steps, saw 247981 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
// Phase 1: matrix 115 rows 90 cols
[2024-05-28 16:17:55] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 16:17:55] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 120/200 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/205 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 120/200 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/205 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 541ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1263 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/90 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-28 16:17:57] [INFO ] Invariant cache hit.
[2024-05-28 16:17:57] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-28 16:17:57] [INFO ] Invariant cache hit.
[2024-05-28 16:17:57] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 16:17:58] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-05-28 16:17:58] [INFO ] Redundant transitions in 0 ms returned []
Running 114 sub problems to find dead transitions.
[2024-05-28 16:17:58] [INFO ] Invariant cache hit.
[2024-05-28 16:17:58] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/205 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 56/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 150 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/205 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 56/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 114/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 264 constraints, problems are : Problem set: 0 solved, 114 unsolved in 5984 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 10298ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 10299ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10688 ms. Remains : 90/90 places, 115/115 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 90 transition count 109
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 85 transition count 109
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 85 transition count 96
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 72 transition count 96
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 63 transition count 87
Applied a total of 55 rules in 4 ms. Remains 63 /90 variables (removed 27) and now considering 87/115 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 87 rows 63 cols
[2024-05-28 16:18:08] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 16:18:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 16:18:08] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 16:18:08] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 16:18:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 16:18:08] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 16:18:08] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 16:18:08] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 16:18:08] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 326 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 365 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 188 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 16:18:09] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 16:18:09] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-28 16:18:09] [INFO ] Invariant cache hit.
[2024-05-28 16:18:09] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 16:18:09] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-05-28 16:18:09] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-28 16:18:09] [INFO ] Invariant cache hit.
[2024-05-28 16:18:09] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-28 16:18:11] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-28 16:18:11] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7202 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 272 constraints, problems are : Problem set: 0 solved, 116 unsolved in 8444 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 15844ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 15846ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16393 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 154 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8960 resets) in 452 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1881 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1912 resets) in 250 ms. (159 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1916 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1886 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1897 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1904 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 423135 steps, run timeout after 3006 ms. (steps per millisecond=140 ) properties seen :3 out of 6
Probabilistic random walk after 423135 steps, saw 182468 distinct states, run finished after 3006 ms. (steps per millisecond=140 ) properties seen :3
[2024-05-28 16:18:29] [INFO ] Invariant cache hit.
[2024-05-28 16:18:29] [INFO ] State equation strengthened by 58 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) 46/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/72 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 102/174 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 43/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 10 (OVERLAPS) 34/208 variables, 19/139 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 15/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 154 constraints, problems are : Problem set: 1 solved, 2 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 16:18:30] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/72 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 102/174 variables, 72/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 43/121 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 34/208 variables, 19/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 15/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 2/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/208 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 157 constraints, problems are : Problem set: 1 solved, 2 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 758ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 551 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 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 90 transition count 115
Applied a total of 3 rules in 14 ms. Remains 90 /91 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 90/91 places, 115/117 transitions.
RANDOM walk for 40000 steps (9001 resets) in 322 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1920 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1900 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 484093 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 2
Probabilistic random walk after 484093 steps, saw 208507 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
// Phase 1: matrix 115 rows 90 cols
[2024-05-28 16:18:34] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 16:18:34] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 120/200 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/205 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 120/200 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/205 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 462ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2041 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 11 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 90/90 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-28 16:18:36] [INFO ] Invariant cache hit.
[2024-05-28 16:18:37] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-28 16:18:37] [INFO ] Invariant cache hit.
[2024-05-28 16:18:37] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 16:18:37] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2024-05-28 16:18:37] [INFO ] Redundant transitions in 0 ms returned []
Running 114 sub problems to find dead transitions.
[2024-05-28 16:18:37] [INFO ] Invariant cache hit.
[2024-05-28 16:18:37] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/205 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 56/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 150 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4660 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/205 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 56/150 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 114/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 264 constraints, problems are : Problem set: 0 solved, 114 unsolved in 6861 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 11621ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 11623ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12155 ms. Remains : 90/90 places, 115/115 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 90 transition count 109
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 85 transition count 109
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 85 transition count 96
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 72 transition count 96
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 63 transition count 87
Applied a total of 55 rules in 7 ms. Remains 63 /90 variables (removed 27) and now considering 87/115 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 87 rows 63 cols
[2024-05-28 16:18:49] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 16:18:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 16:18:49] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 16:18:49] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 16:18:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 16:18:49] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 16:18:49] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 16:18:49] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 16:18:49] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 291 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 341 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 203 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 245 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Product exploration explored 100000 steps with 22550 reset in 267 ms.
Product exploration explored 100000 steps with 22525 reset in 284 ms.
Built C files in :
/tmp/ltsmin3906729825699220506
[2024-05-28 16:18:50] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-28 16:18:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:18:50] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-28 16:18:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:18:50] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-28 16:18:50] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:18:50] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3906729825699220506
Running compilation step : cd /tmp/ltsmin3906729825699220506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 553 ms.
Running link step : cd /tmp/ltsmin3906729825699220506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin3906729825699220506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15528971258616003733.hoa' '--buchi-type=spotba'
LTSmin run took 1614 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 finished in 79566 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((p0 U !p1)))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 160
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 108 transition count 146
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 108 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 108 transition count 141
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 98 transition count 131
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 98 transition count 131
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 96 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 94 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 94 transition count 121
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 92 transition count 118
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 92 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 92 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 90 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 89 transition count 112
Applied a total of 108 rules in 12 ms. Remains 89 /136 variables (removed 47) and now considering 112/251 (removed 139) transitions.
// Phase 1: matrix 112 rows 89 cols
[2024-05-28 16:18:53] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 16:18:53] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-28 16:18:53] [INFO ] Invariant cache hit.
[2024-05-28 16:18:53] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-28 16:18:53] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-05-28 16:18:53] [INFO ] Redundant transitions in 0 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-28 16:18:53] [INFO ] Invariant cache hit.
[2024-05-28 16:18:53] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-28 16:18:55] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-28 16:18:55] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 112/201 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 54/150 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 111 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 150 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7198 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 112/201 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 54/150 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 111/261 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 261 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6430 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 2/2 constraints]
After SMT, in 13750ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 13752ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/136 places, 112/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14198 ms. Remains : 89/136 places, 112/251 transitions.
Stuttering acceptance computed with spot in 87 ms :[p1, true, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-15
Product exploration explored 100000 steps with 22407 reset in 142 ms.
Product exploration explored 100000 steps with 22421 reset in 164 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 292 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (OR (NOT p1) p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[p1, true, p1]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (9014 resets) in 363 ms. (109 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1877 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1889 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1882 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1942 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 487916 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :2 out of 4
Probabilistic random walk after 487916 steps, saw 209307 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :2
[2024-05-28 16:19:11] [INFO ] Invariant cache hit.
[2024-05-28 16:19:11] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/72 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 99/171 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 41/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 30/201 variables, 17/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 13/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/201 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 148 constraints, problems are : Problem set: 1 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/66 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/71 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 91/162 variables, 71/76 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 33/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/201 variables, 18/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 21/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/201 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 149 constraints, problems are : Problem set: 1 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 403ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 1394 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 112/112 transitions.
Graph (complete) has 259 edges and 89 vertex of which 88 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 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 87 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 86 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 86 transition count 101
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 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 85 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 85 transition count 99
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 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 84 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 83 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 83 transition count 96
Applied a total of 15 rules in 6 ms. Remains 83 /89 variables (removed 6) and now considering 96/112 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 83/89 places, 96/112 transitions.
RANDOM walk for 40000 steps (8964 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1983 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 122993 steps, run visited all 1 properties in 296 ms. (steps per millisecond=415 )
Probabilistic random walk after 122993 steps, saw 54256 distinct states, run finished after 296 ms. (steps per millisecond=415 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (OR (NOT p1) p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 12 factoid took 143 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 finished in 20469 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(F(!p0))||(F(!p0)&&G(F(!p1)))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
Stuttering acceptance computed with spot in 268 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 153
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 153
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 108 transition count 139
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 108 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 62 place count 108 transition count 133
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 72 place count 98 transition count 123
Iterating global reduction 1 with 10 rules applied. Total rules applied 82 place count 98 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 89 place count 98 transition count 116
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 95 transition count 113
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 110
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 90 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 90 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 90 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 88 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 87 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 87 transition count 102
Applied a total of 113 rules in 18 ms. Remains 87 /136 variables (removed 49) and now considering 102/251 (removed 149) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-05-28 16:19:14] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 16:19:14] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-28 16:19:14] [INFO ] Invariant cache hit.
[2024-05-28 16:19:14] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 16:19:14] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-28 16:19:14] [INFO ] Invariant cache hit.
[2024-05-28 16:19:14] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 16:19:17] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5166 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5525 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 10828ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 10830ms
Starting structural reductions in LI_LTL mode, iteration 1 : 87/136 places, 102/251 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11597 ms. Remains : 87/136 places, 102/251 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
Product exploration explored 100000 steps with 22418 reset in 128 ms.
Product exploration explored 100000 steps with 22510 reset in 124 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (9099 resets) in 248 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1892 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1876 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1864 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2487 steps, run visited all 3 properties in 20 ms. (steps per millisecond=124 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 20 ms. (steps per millisecond=124 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-28 16:19:26] [INFO ] Invariant cache hit.
[2024-05-28 16:19:26] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-28 16:19:26] [INFO ] Invariant cache hit.
[2024-05-28 16:19:26] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 16:19:27] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-28 16:19:27] [INFO ] Redundant transitions in 0 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-28 16:19:27] [INFO ] Invariant cache hit.
[2024-05-28 16:19:27] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 16:19:28] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:19:28] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 16:19:29] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4539 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4901 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 9517ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 9518ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9920 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (9003 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1879 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1940 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1911 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2487 steps, run visited all 3 properties in 40 ms. (steps per millisecond=62 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 40 ms. (steps per millisecond=62 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 89 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22506 reset in 119 ms.
Product exploration explored 100000 steps with 22444 reset in 136 ms.
Built C files in :
/tmp/ltsmin6044913314766259203
[2024-05-28 16:19:37] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-28 16:19:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:19:37] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-28 16:19:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:19:37] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-28 16:19:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:19:37] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6044913314766259203
Running compilation step : cd /tmp/ltsmin6044913314766259203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 418 ms.
Running link step : cd /tmp/ltsmin6044913314766259203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6044913314766259203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6594689036043308091.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-28 16:19:52] [INFO ] Invariant cache hit.
[2024-05-28 16:19:52] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 16:19:52] [INFO ] Invariant cache hit.
[2024-05-28 16:19:52] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 16:19:53] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-05-28 16:19:53] [INFO ] Redundant transitions in 0 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-28 16:19:53] [INFO ] Invariant cache hit.
[2024-05-28 16:19:53] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 16:19:54] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:19:54] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-28 16:19:55] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 141 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4729 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/189 variables, 87/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 101/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4821 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 9634ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 9635ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9976 ms. Remains : 87/87 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin12756695995252583454
[2024-05-28 16:20:02] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-28 16:20:02] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:20:02] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-28 16:20:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:20:02] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-28 16:20:02] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:20:02] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12756695995252583454
Running compilation step : cd /tmp/ltsmin12756695995252583454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 398 ms.
Running link step : cd /tmp/ltsmin12756695995252583454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12756695995252583454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14736484170806012528.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 16:20:17] [INFO ] Flatten gal took : 20 ms
[2024-05-28 16:20:17] [INFO ] Flatten gal took : 10 ms
[2024-05-28 16:20:17] [INFO ] Time to serialize gal into /tmp/LTL8157261002101431191.gal : 2 ms
[2024-05-28 16:20:17] [INFO ] Time to serialize properties into /tmp/LTL18096334442408755260.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8157261002101431191.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6604203522507581750.hoa' '-atoms' '/tmp/LTL18096334442408755260.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18096334442408755260.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6604203522507581750.hoa
Detected timeout of ITS tools.
[2024-05-28 16:20:32] [INFO ] Flatten gal took : 6 ms
[2024-05-28 16:20:32] [INFO ] Flatten gal took : 6 ms
[2024-05-28 16:20:32] [INFO ] Time to serialize gal into /tmp/LTL18398597118764369001.gal : 1 ms
[2024-05-28 16:20:32] [INFO ] Time to serialize properties into /tmp/LTL14738683010571635634.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18398597118764369001.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14738683010571635634.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((s1<1)||(l1191<1))")))||((F("((s1<1)||(l1191<1))"))&&(G(F("(((s1<1)||(l354<1))||((s1<1)||(l1191<1)))"))))))))
Formula 0 simplified : XX(FG!"((s1<1)||(l1191<1))" & (G!"((s1<1)||(l1191<1))" | FG!"(((s1<1)||(l354<1))||((s1<1)||(l1191<1)))"))
Detected timeout of ITS tools.
[2024-05-28 16:20:48] [INFO ] Flatten gal took : 6 ms
[2024-05-28 16:20:48] [INFO ] Applying decomposition
[2024-05-28 16:20:48] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1139749660561525788.txt' '-o' '/tmp/graph1139749660561525788.bin' '-w' '/tmp/graph1139749660561525788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1139749660561525788.bin' '-l' '-1' '-v' '-w' '/tmp/graph1139749660561525788.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:20:48] [INFO ] Decomposing Gal with order
[2024-05-28 16:20:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:20:48] [INFO ] Removed a total of 96 redundant transitions.
[2024-05-28 16:20:48] [INFO ] Flatten gal took : 15 ms
[2024-05-28 16:20:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 4 ms.
[2024-05-28 16:20:48] [INFO ] Time to serialize gal into /tmp/LTL13627241726701685645.gal : 3 ms
[2024-05-28 16:20:48] [INFO ] Time to serialize properties into /tmp/LTL12075913336935797848.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13627241726701685645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12075913336935797848.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((i0.u0.s1<1)||(u18.l1191<1))")))||((F("((i0.u0.s1<1)||(u18.l1191<1))"))&&(G(F("(((i0.u0.s1<1)||(i0.u0.l354<1))||((i0.u0....186
Formula 0 simplified : XX(FG!"((i0.u0.s1<1)||(u18.l1191<1))" & (G!"((i0.u0.s1<1)||(u18.l1191<1))" | FG!"(((i0.u0.s1<1)||(i0.u0.l354<1))||((i0.u0.s1<1)||(u1...170
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 finished in 109513 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&&((!p2 U (p3||G(!p2)))||p1)))))'
[2024-05-28 16:21:03] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13123655293383789940
[2024-05-28 16:21:03] [INFO ] Computing symmetric may disable matrix : 251 transitions.
[2024-05-28 16:21:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:21:03] [INFO ] Applying decomposition
[2024-05-28 16:21:03] [INFO ] Computing symmetric may enable matrix : 251 transitions.
[2024-05-28 16:21:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:21:03] [INFO ] Flatten gal took : 12 ms
[2024-05-28 16:21:03] [INFO ] Computing Do-Not-Accords matrix : 251 transitions.
[2024-05-28 16:21:03] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:21:03] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13123655293383789940
Running compilation step : cd /tmp/ltsmin13123655293383789940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3218665343865169521.txt' '-o' '/tmp/graph3218665343865169521.bin' '-w' '/tmp/graph3218665343865169521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3218665343865169521.bin' '-l' '-1' '-v' '-w' '/tmp/graph3218665343865169521.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:21:03] [INFO ] Decomposing Gal with order
[2024-05-28 16:21:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:21:03] [INFO ] Removed a total of 258 redundant transitions.
[2024-05-28 16:21:03] [INFO ] Flatten gal took : 99 ms
[2024-05-28 16:21:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 195 labels/synchronizations in 25 ms.
[2024-05-28 16:21:03] [INFO ] Time to serialize gal into /tmp/LTLFireability8588848671358672550.gal : 5 ms
[2024-05-28 16:21:03] [INFO ] Time to serialize properties into /tmp/LTLFireability15860806841498923302.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8588848671358672550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15860806841498923302.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(X((G(F(!("((i0.u0.s1>=1)&&(u18.l1191>=1))"))))||((F(!("((i0.u0.s1>=1)&&(u18.l1191>=1))")))&&(G(F(!("(((i0.u0.s1>=1)&&(i4.u16.l354...204
Formula 0 simplified : XX(FG"((i0.u0.s1>=1)&&(u18.l1191>=1))" & (G"((i0.u0.s1>=1)&&(u18.l1191>=1))" | FG"(((i0.u0.s1>=1)&&(i4.u16.l354>=1))&&((i0.u0.s1>=1)...176
Compilation finished in 1174 ms.
Running link step : cd /tmp/ltsmin13123655293383789940;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13123655293383789940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: LTL layer: formula: X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.020: "X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.020: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.067: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.111: DFS-FIFO for weak LTL, using special progress label 258
pins2lts-mc-linux64( 0/ 8), 0.111: There are 259 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.111: State length is 137, there are 259 groups
pins2lts-mc-linux64( 0/ 8), 0.111: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.111: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.111: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.111: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.157: ~1 levels ~960 states ~1928 transitions
pins2lts-mc-linux64( 0/ 8), 0.164: ~1 levels ~1920 states ~3704 transitions
pins2lts-mc-linux64( 0/ 8), 0.218: ~1 levels ~3840 states ~7944 transitions
pins2lts-mc-linux64( 0/ 8), 0.287: ~1 levels ~7680 states ~15336 transitions
pins2lts-mc-linux64( 3/ 8), 0.485: ~1 levels ~15360 states ~37480 transitions
pins2lts-mc-linux64( 3/ 8), 0.751: ~1 levels ~30720 states ~70656 transitions
pins2lts-mc-linux64( 2/ 8), 1.272: ~4 levels ~61440 states ~140960 transitions
pins2lts-mc-linux64( 3/ 8), 2.164: ~4 levels ~122880 states ~272256 transitions
pins2lts-mc-linux64( 3/ 8), 3.815: ~5 levels ~245760 states ~576072 transitions
pins2lts-mc-linux64( 3/ 8), 6.157: ~6 levels ~491520 states ~1169600 transitions
pins2lts-mc-linux64( 3/ 8), 9.601: ~6 levels ~983040 states ~2363680 transitions
pins2lts-mc-linux64( 3/ 8), 15.263: ~6 levels ~1966080 states ~4751656 transitions
pins2lts-mc-linux64( 5/ 8), 26.471: ~7 levels ~3932160 states ~9568808 transitions
pins2lts-mc-linux64( 0/ 8), 48.363: ~8 levels ~7864320 states ~18869528 transitions
pins2lts-mc-linux64( 0/ 8), 91.730: ~8 levels ~15728640 states ~38835000 transitions
pins2lts-mc-linux64( 0/ 8), 177.427: ~9 levels ~31457280 states ~76237856 transitions
pins2lts-mc-linux64( 0/ 8), 351.862: ~10 levels ~62914560 states ~155119760 transitions
pins2lts-mc-linux64( 0/ 8), 713.363: ~10 levels ~125829120 states ~320286504 transitions
pins2lts-mc-linux64( 4/ 8), 742.274: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 742.371:
pins2lts-mc-linux64( 0/ 8), 742.371: mean standard work distribution: 0.7% (states) 1.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 742.371:
pins2lts-mc-linux64( 0/ 8), 742.371: Explored 126459788 states 325233275 transitions, fanout: 2.572
pins2lts-mc-linux64( 0/ 8), 742.371: Total exploration time 742.240 sec (742.170 sec minimum, 742.214 sec on average)
pins2lts-mc-linux64( 0/ 8), 742.371: States per second: 170376, Transitions per second: 438178
pins2lts-mc-linux64( 0/ 8), 742.371:
pins2lts-mc-linux64( 0/ 8), 742.371: Progress states detected: 133037648
pins2lts-mc-linux64( 0/ 8), 742.371: Redundant explorations: -5.7799
pins2lts-mc-linux64( 0/ 8), 742.371:
pins2lts-mc-linux64( 0/ 8), 742.371: Queue width: 8B, total height: 16153391, memory: 123.24MB
pins2lts-mc-linux64( 0/ 8), 742.371: Tree memory: 1032.1MB, 8.1 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 742.371: Tree fill ratio (roots/leafs): 99.0%/3.0%
pins2lts-mc-linux64( 0/ 8), 742.371: Stored 251 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 742.371: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 742.371: Est. total memory use: 1155.3MB (~1147.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13123655293383789940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13123655293383789940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-28 16:46:31] [INFO ] Flatten gal took : 22 ms
[2024-05-28 16:46:31] [INFO ] Time to serialize gal into /tmp/LTLFireability181979182395503710.gal : 3 ms
[2024-05-28 16:46:31] [INFO ] Time to serialize properties into /tmp/LTLFireability9803779271060444759.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability181979182395503710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9803779271060444759.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 2 LTL properties
Checking formula 0 : !((X(X((G(F(!("((s1>=1)&&(l1191>=1))"))))||((F(!("((s1>=1)&&(l1191>=1))")))&&(G(F(!("(((s1>=1)&&(l354>=1))&&((s1>=1)&&(l1191>=1)))")))...161
Formula 0 simplified : XX(FG"((s1>=1)&&(l1191>=1))" & (G"((s1>=1)&&(l1191>=1))" | FG"(((s1>=1)&&(l354>=1))&&((s1>=1)&&(l1191>=1)))"))
ITS-tools command line returned an error code 137
[2024-05-28 17:04:08] [INFO ] Flatten gal took : 13 ms
[2024-05-28 17:04:08] [INFO ] Input system was already deterministic with 251 transitions.
[2024-05-28 17:04:08] [INFO ] Transformed 136 places.
[2024-05-28 17:04:08] [INFO ] Transformed 251 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 17:04:08] [INFO ] Time to serialize gal into /tmp/LTLFireability16605113360124293940.gal : 3 ms
[2024-05-28 17:04:08] [INFO ] Time to serialize properties into /tmp/LTLFireability7249616187449413429.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16605113360124293940.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7249616187449413429.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((G(F(!("((s1>=1)&&(l1191>=1))"))))||((F(!("((s1>=1)&&(l1191>=1))")))&&(G(F(!("(((s1>=1)&&(l354>=1))&&((s1>=1)&&(l1191>=1)))")))...161
Formula 0 simplified : XX(FG"((s1>=1)&&(l1191>=1))" & (G"((s1>=1)&&(l1191>=1))" | FG"(((s1>=1)&&(l354>=1))&&((s1>=1)&&(l1191>=1)))"))

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d1m64"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m64, 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 r378-smll-171683810700084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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