Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 19:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 19:22 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-d1m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717244076975

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m36
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:14:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:14:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:14:39] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2024-06-01 12:14:39] [INFO ] Transformed 1295 places.
[2024-06-01 12:14:39] [INFO ] Transformed 749 transitions.
[2024-06-01 12:14:39] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 617 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1036 places in 21 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 306 place count 193 transition count 370
Iterating global reduction 1 with 49 rules applied. Total rules applied 355 place count 193 transition count 370
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 361 place count 193 transition count 364
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 392 place count 162 transition count 333
Iterating global reduction 2 with 31 rules applied. Total rules applied 423 place count 162 transition count 333
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 436 place count 162 transition count 320
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 453 place count 145 transition count 302
Iterating global reduction 3 with 17 rules applied. Total rules applied 470 place count 145 transition count 302
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 3 with 49 rules applied. Total rules applied 519 place count 145 transition count 253
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 522 place count 142 transition count 249
Iterating global reduction 4 with 3 rules applied. Total rules applied 525 place count 142 transition count 249
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 528 place count 139 transition count 246
Iterating global reduction 4 with 3 rules applied. Total rules applied 531 place count 139 transition count 246
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 533 place count 137 transition count 243
Iterating global reduction 4 with 2 rules applied. Total rules applied 535 place count 137 transition count 243
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 536 place count 136 transition count 242
Iterating global reduction 4 with 1 rules applied. Total rules applied 537 place count 136 transition count 242
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 538 place count 135 transition count 241
Iterating global reduction 4 with 1 rules applied. Total rules applied 539 place count 135 transition count 241
Applied a total of 539 rules in 149 ms. Remains 135 /259 variables (removed 124) and now considering 241/749 (removed 508) transitions.
// Phase 1: matrix 241 rows 135 cols
[2024-06-01 12:14:40] [INFO ] Computed 5 invariants in 27 ms
[2024-06-01 12:14:40] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-06-01 12:14:40] [INFO ] Invariant cache hit.
[2024-06-01 12:14:40] [INFO ] State equation strengthened by 148 read => feed constraints.
[2024-06-01 12:14:41] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-06-01 12:14:41] [INFO ] Invariant cache hit.
[2024-06-01 12:14:41] [INFO ] State equation strengthened by 148 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 12:14:48] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 21 ms to minimize.
[2024-06-01 12:14:48] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 241/376 variables, 135/142 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 148/290 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 290 constraints, problems are : Problem set: 0 solved, 240 unsolved in 23811 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 241/376 variables, 135/142 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 148/290 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 240/530 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 12:15:16] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 531 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 3/3 constraints]
After SMT, in 54901ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 54935ms
Starting structural reductions in LTL mode, iteration 1 : 135/259 places, 241/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56460 ms. Remains : 135/259 places, 241/749 transitions.
Support contains 26 out of 135 places after structural reductions.
[2024-06-01 12:15:36] [INFO ] Flatten gal took : 81 ms
[2024-06-01 12:15:36] [INFO ] Flatten gal took : 40 ms
[2024-06-01 12:15:37] [INFO ] Input system was already deterministic with 241 transitions.
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40000 steps (9005 resets) in 3765 ms. (10 steps per ms) remains 20/23 properties
BEST_FIRST walk for 4004 steps (195 resets) in 67 ms. (58 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (175 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (197 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (179 resets) in 43 ms. (91 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (450 resets) in 71 ms. (55 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (204 resets) in 46 ms. (85 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (198 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (406 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (186 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (196 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (422 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (181 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (200 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (206 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (181 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (194 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (173 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (192 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (182 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (176 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
[2024-06-01 12:15:38] [INFO ] Invariant cache hit.
[2024-06-01 12:15:38] [INFO ] State equation strengthened by 148 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 55/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 8/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 31/117 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 12:15:39] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 226/343 variables, 117/123 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 133/256 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 33/376 variables, 18/274 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 15/289 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/376 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/376 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 289 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2331 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 55/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 8/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 31/117 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 226/343 variables, 117/123 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 133/256 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 33/376 variables, 18/275 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/376 variables, 15/290 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/376 variables, 19/309 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 12:15:43] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/376 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/376 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 0/376 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 310 constraints, problems are : Problem set: 0 solved, 20 unsolved in 4728 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 2/2 constraints]
After SMT, in 7192ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 0 properties in 10373 ms.
Support contains 23 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 241/241 transitions.
Graph (complete) has 454 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 134 transition count 239
Applied a total of 3 rules in 65 ms. Remains 134 /135 variables (removed 1) and now considering 239/241 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 134/135 places, 239/241 transitions.
RANDOM walk for 40000 steps (8927 resets) in 654 ms. (61 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (196 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (193 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (183 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (171 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (397 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (196 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (212 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (444 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (187 resets) in 37 ms. (105 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (200 resets) in 73 ms. (54 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (409 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (183 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (183 resets) in 37 ms. (105 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (194 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (186 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (180 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (197 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (194 resets) in 61 ms. (64 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (189 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (188 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 219415 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :14 out of 20
Probabilistic random walk after 219415 steps, saw 102257 distinct states, run finished after 3008 ms. (steps per millisecond=72 ) properties seen :14
// Phase 1: matrix 239 rows 134 cols
[2024-06-01 12:15:59] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 12:15:59] [INFO ] State equation strengthened by 146 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/88 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 163/251 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 70/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 122/373 variables, 46/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 76/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/373 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 284 constraints, problems are : Problem set: 0 solved, 6 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, ReadFeed: 146/146 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/88 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 163/251 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 70/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 122/373 variables, 46/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 76/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 6/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/373 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 12:16:01] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/373 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/373 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 291 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1973 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, ReadFeed: 146/146 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 2618ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 1 properties in 5535 ms.
Support contains 7 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 239/239 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 123 transition count 170
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 123 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 123 transition count 169
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 33 place count 113 transition count 158
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 113 transition count 158
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 47 place count 113 transition count 154
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 107 transition count 148
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 107 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 107 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 105 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 105 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 103 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 103 transition count 141
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 101 transition count 139
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 101 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 78 place count 101 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 100 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 100 transition count 134
Applied a total of 80 rules in 47 ms. Remains 100 /134 variables (removed 34) and now considering 134/239 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 100/134 places, 134/239 transitions.
RANDOM walk for 40000 steps (8993 resets) in 174 ms. (228 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1969 resets) in 169 ms. (235 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4085 resets) in 108 ms. (366 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1891 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1904 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 457670 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :2 out of 5
Probabilistic random walk after 457670 steps, saw 192221 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :2
// Phase 1: matrix 134 rows 100 cols
[2024-06-01 12:16:11] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 12:16:11] [INFO ] State equation strengthened by 66 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) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/68 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 115/183 variables, 68/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 47/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 51/234 variables, 32/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 19/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:16:11] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/234 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 171 constraints, problems are : Problem set: 0 solved, 3 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 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) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/68 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:16:11] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 2 ms to minimize.
[2024-06-01 12:16:11] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 115/183 variables, 68/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 47/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 51/234 variables, 32/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 19/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/234 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/234 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 1011ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 5764 ms.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 134/134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 98 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 96 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 96 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 96 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 95 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 95 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 95 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 94 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 94 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 93 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 93 transition count 116
Applied a total of 17 rules in 20 ms. Remains 93 /100 variables (removed 7) and now considering 116/134 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 93/100 places, 116/134 transitions.
RANDOM walk for 40000 steps (9046 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1977 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1897 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1986 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 485776 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 3
Probabilistic random walk after 485776 steps, saw 220197 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
// Phase 1: matrix 116 rows 93 cols
[2024-06-01 12:16:21] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 12:16:21] [INFO ] State equation strengthened by 55 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) 46/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/65 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:16:21] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 105/170 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 44/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 39/209 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 11/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/209 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 153 constraints, problems are : Problem set: 0 solved, 3 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 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) 46/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/65 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 105/170 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 44/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 39/209 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 11/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/209 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 156 constraints, problems are : Problem set: 0 solved, 3 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 724ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2556 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 116/116 transitions.
Applied a total of 0 rules in 25 ms. Remains 93 /93 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 93/93 places, 116/116 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 116/116 transitions.
Applied a total of 0 rules in 16 ms. Remains 93 /93 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-06-01 12:16:24] [INFO ] Invariant cache hit.
[2024-06-01 12:16:24] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 12:16:24] [INFO ] Invariant cache hit.
[2024-06-01 12:16:24] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 12:16:25] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-06-01 12:16:25] [INFO ] Redundant transitions in 5 ms returned []
Running 115 sub problems to find dead transitions.
[2024-06-01 12:16:25] [INFO ] Invariant cache hit.
[2024-06-01 12:16:25] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/209 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 55/152 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 152 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3715 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/209 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 55/152 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 115/267 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 12:16:31] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/209 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 268 constraints, problems are : Problem set: 0 solved, 115 unsolved in 11681 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 1/1 constraints]
After SMT, in 15598ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 15603ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16179 ms. Remains : 93/93 places, 116/116 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 110
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 110
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 97
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 97
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 66 transition count 88
Applied a total of 55 rules in 26 ms. Remains 66 /93 variables (removed 27) and now considering 88/116 (removed 28) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 88 rows 66 cols
[2024-06-01 12:16:40] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 12:16:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:16:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:16:41] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 12:16:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:16:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:16:41] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 12:16:41] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 12:16:41] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 554 ms.
Computed a total of 27 stabilizing places and 45 stable transitions
Graph (complete) has 504 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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(p1))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 159
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 108 transition count 144
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 108 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 108 transition count 139
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 101 transition count 132
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 101 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 101 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 98 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 98 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 95 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 91 transition count 117
Applied a total of 98 rules in 64 ms. Remains 91 /135 variables (removed 44) and now considering 117/241 (removed 124) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-06-01 12:16:42] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 12:16:42] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 12:16:42] [INFO ] Invariant cache hit.
[2024-06-01 12:16:42] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 12:16:42] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-06-01 12:16:42] [INFO ] Redundant transitions in 3 ms returned []
Running 116 sub problems to find dead transitions.
[2024-06-01 12:16:42] [INFO ] Invariant cache hit.
[2024-06-01 12:16:42] [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-06-01 12:16:44] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:16:44] [INFO ] Deduced a trap composed of 27 places in 61 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
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 6560 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 7457 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 14144ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 14146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/135 places, 117/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14717 ms. Remains : 91/135 places, 117/241 transitions.
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-00
Product exploration explored 100000 steps with 22542 reset in 757 ms.
Product exploration explored 100000 steps with 22281 reset in 333 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.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 219 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8982 resets) in 311 ms. (128 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1952 resets) in 348 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1898 resets) in 393 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1899 resets) in 264 ms. (150 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1961 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1929 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1841 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 474101 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :4 out of 6
Probabilistic random walk after 474101 steps, saw 213015 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :4
[2024-06-01 12:17:02] [INFO ] Invariant cache hit.
[2024-06-01 12:17:02] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/72 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/174 variables, 72/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 43/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 34/208 variables, 19/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 15/154 constraints. Problems are: Problem set: 1 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: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 154 constraints, problems are : Problem set: 1 solved, 1 unsolved in 141 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/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/72 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/174 variables, 72/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 43/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 34/208 variables, 19/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 15/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 1/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 155 constraints, problems are : Problem set: 1 solved, 1 unsolved in 208 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/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 375ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 412 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.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
Applied a total of 3 rules in 11 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 13 ms. Remains : 90/91 places, 115/117 transitions.
RANDOM walk for 40000 steps (9005 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1879 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2062596 steps, run timeout after 3001 ms. (steps per millisecond=687 ) properties seen :0 out of 1
Probabilistic random walk after 2062596 steps, saw 915104 distinct states, run finished after 3001 ms. (steps per millisecond=687 ) properties seen :0
// Phase 1: matrix 115 rows 90 cols
[2024-06-01 12:17:05] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 12:17:05] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 120/200 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 1 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, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/205 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 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: 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 120/200 variables, 82/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/205 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 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: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 549ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 242 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 7 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 7 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 7 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-06-01 12:17:06] [INFO ] Invariant cache hit.
[2024-06-01 12:17:06] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 12:17:06] [INFO ] Invariant cache hit.
[2024-06-01 12:17:07] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 12:17:07] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2024-06-01 12:17:07] [INFO ] Redundant transitions in 5 ms returned []
Running 114 sub problems to find dead transitions.
[2024-06-01 12:17:07] [INFO ] Invariant cache hit.
[2024-06-01 12:17:07] [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 4712 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 6516 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 11425ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 11427ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12014 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 13 ms. Remains 63 /90 variables (removed 27) and now considering 87/115 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 87 rows 63 cols
[2024-06-01 12:17:18] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 12:17:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:17:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:17:18] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:17:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:17:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:17:19] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:17:19] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:17:19] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 316 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 14 factoid took 482 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
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 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-06-01 12:17:19] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 12:17:19] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-01 12:17:19] [INFO ] Invariant cache hit.
[2024-06-01 12:17:19] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 12:17:20] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2024-06-01 12:17:20] [INFO ] Redundant transitions in 5 ms returned []
Running 116 sub problems to find dead transitions.
[2024-06-01 12:17:20] [INFO ] Invariant cache hit.
[2024-06-01 12:17:20] [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-06-01 12:17:22] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 3 ms to minimize.
[2024-06-01 12:17:22] [INFO ] Deduced a trap composed of 27 places in 57 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
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 7246 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 7079 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 14524ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 14527ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15139 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.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 45 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8909 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1922 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4289 steps, run visited all 1 properties in 58 ms. (steps per millisecond=73 )
Probabilistic random walk after 4289 steps, saw 1916 distinct states, run finished after 66 ms. (steps per millisecond=64 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22502 reset in 420 ms.
Product exploration explored 100000 steps with 22369 reset in 247 ms.
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 22 ms. Remains 84 /91 variables (removed 7) and now considering 98/117 (removed 19) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-06-01 12:17:36] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 12:17:36] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 12:17:36] [INFO ] Invariant cache hit.
[2024-06-01 12:17:36] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:17:36] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-06-01 12:17:36] [INFO ] Redundant transitions in 6 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 12:17:36] [INFO ] Invariant cache hit.
[2024-06-01 12:17:36] [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-06-01 12:17:37] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:17:37] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 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 5131 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 8157 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 13380ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 13381ms
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 13870 ms. Remains : 84/91 places, 98/117 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 finished in 68292 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)&&(G(p1)||X(p2)))))'
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 146
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 145
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 108 transition count 130
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 108 transition count 130
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 108 transition count 123
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 69 place count 101 transition count 116
Iterating global reduction 2 with 7 rules applied. Total rules applied 76 place count 101 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 101 transition count 112
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 97 transition count 108
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 97 transition count 108
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 93 transition count 104
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 93 transition count 104
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 90 transition count 101
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 90 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 104 place count 90 transition count 99
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 88 transition count 97
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 88 transition count 97
Applied a total of 108 rules in 14 ms. Remains 88 /135 variables (removed 47) and now considering 97/241 (removed 144) transitions.
// Phase 1: matrix 97 rows 88 cols
[2024-06-01 12:17:50] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 12:17:50] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 12:17:50] [INFO ] Invariant cache hit.
[2024-06-01 12:17:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 12:17:50] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 12:17:50] [INFO ] Invariant cache hit.
[2024-06-01 12:17:50] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:17:52] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:17:52] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/185 variables, 88/95 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 40/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 135 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5583 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 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/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/185 variables, 88/95 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 40/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 96/231 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:17:58] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 232 constraints, problems are : Problem set: 0 solved, 96 unsolved in 8158 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints]
After SMT, in 13877ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 13879ms
Starting structural reductions in LTL mode, iteration 1 : 88/135 places, 97/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14336 ms. Remains : 88/135 places, 97/241 transitions.
Stuttering acceptance computed with spot in 422 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 finished in 14793 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(F(!p0))||(F(!p0)&&(X(G(!p0))||G(!p1))))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 152
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 152
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 41 place count 108 transition count 138
Iterating global reduction 0 with 13 rules applied. Total rules applied 54 place count 108 transition count 138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 60 place count 108 transition count 132
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 67 place count 101 transition count 125
Iterating global reduction 1 with 7 rules applied. Total rules applied 74 place count 101 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 79 place count 101 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 98 transition count 117
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 98 transition count 117
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 95 transition count 114
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 95 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 94 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 94 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 94 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 93 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 93 transition count 110
Applied a total of 97 rules in 64 ms. Remains 93 /135 variables (removed 42) and now considering 110/241 (removed 131) transitions.
// Phase 1: matrix 110 rows 93 cols
[2024-06-01 12:18:05] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 12:18:05] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-06-01 12:18:05] [INFO ] Invariant cache hit.
[2024-06-01 12:18:05] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:18:05] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
[2024-06-01 12:18:05] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-06-01 12:18:05] [INFO ] Invariant cache hit.
[2024-06-01 12:18:05] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:18:07] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:18:07] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/203 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 49/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:18:09] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 150 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6908 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/203 variables, 93/101 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 49/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 109/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 259 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6392 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
After SMT, in 13458ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 13461ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/135 places, 110/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14201 ms. Remains : 93/135 places, 110/241 transitions.
Stuttering acceptance computed with spot in 126 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-03
Product exploration explored 100000 steps with 22412 reset in 139 ms.
Product exploration explored 100000 steps with 22515 reset in 262 ms.
Computed a total of 22 stabilizing places and 29 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 22 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (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 141 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[p0, (AND p1 p0), p0]
RANDOM walk for 40000 steps (8954 resets) in 421 ms. (94 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1880 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1876 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1872 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 2025761 steps, run timeout after 3001 ms. (steps per millisecond=675 ) properties seen :2 out of 3
Probabilistic random walk after 2025761 steps, saw 941130 distinct states, run finished after 3001 ms. (steps per millisecond=675 ) properties seen :2
[2024-06-01 12:18:23] [INFO ] Invariant cache hit.
[2024-06-01 12:18:23] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/76 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 97/173 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 36/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 203/203 variables, and 134 constraints, problems are : Problem set: 1 solved, 0 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 36/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (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))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 8 factoid took 172 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 127 ms :[p0, (AND p1 p0), p0]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-06-01 12:18:23] [INFO ] Invariant cache hit.
[2024-06-01 12:18:23] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 12:18:23] [INFO ] Invariant cache hit.
[2024-06-01 12:18:24] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:18:24] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-06-01 12:18:24] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-06-01 12:18:24] [INFO ] Invariant cache hit.
[2024-06-01 12:18:24] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:18:26] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:18:26] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/203 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 49/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:18:28] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 150 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/203 variables, 93/101 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 49/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 109/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 259 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7219 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
After SMT, in 14486ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 14489ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15010 ms. Remains : 93/93 places, 110/110 transitions.
Computed a total of 22 stabilizing places and 29 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (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 96 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[p0, (AND p1 p0), p0]
RANDOM walk for 40000 steps (8954 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1905 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1863 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1941 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1772335 steps, run timeout after 3001 ms. (steps per millisecond=590 ) properties seen :2 out of 3
Probabilistic random walk after 1772335 steps, saw 822154 distinct states, run finished after 3001 ms. (steps per millisecond=590 ) properties seen :2
[2024-06-01 12:18:42] [INFO ] Invariant cache hit.
[2024-06-01 12:18:42] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/76 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 97/173 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 36/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 203/203 variables, and 134 constraints, problems are : Problem set: 1 solved, 0 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 36/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (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))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 8 factoid took 204 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 150 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 156 ms :[p0, (AND p1 p0), p0]
Product exploration explored 100000 steps with 22375 reset in 249 ms.
Product exploration explored 100000 steps with 22611 reset in 280 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-06-01 12:18:43] [INFO ] Invariant cache hit.
[2024-06-01 12:18:43] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-01 12:18:43] [INFO ] Invariant cache hit.
[2024-06-01 12:18:43] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:18:44] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-06-01 12:18:44] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-06-01 12:18:44] [INFO ] Invariant cache hit.
[2024-06-01 12:18:44] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:18:46] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:18:46] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/203 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 49/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:18:48] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 150 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7325 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/203 variables, 93/101 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 49/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 109/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 259 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6350 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
After SMT, in 13842ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 13844ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14455 ms. Remains : 93/93 places, 110/110 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-03 finished in 53170 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||G(p1)||G((F(p3)&&p2))))))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 122 transition count 153
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 122 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 122 transition count 152
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 40 place count 109 transition count 138
Iterating global reduction 1 with 13 rules applied. Total rules applied 53 place count 109 transition count 138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 58 place count 109 transition count 133
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 101 transition count 125
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 101 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 101 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 98 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 98 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 95 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 95 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 93 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 93 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 93 transition count 111
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 91 transition count 108
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 91 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 90 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 90 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 89 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 89 transition count 106
Applied a total of 104 rules in 8 ms. Remains 89 /135 variables (removed 46) and now considering 106/241 (removed 135) transitions.
// Phase 1: matrix 106 rows 89 cols
[2024-06-01 12:18:58] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 12:18:58] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 12:18:58] [INFO ] Invariant cache hit.
[2024-06-01 12:18:58] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 12:18:58] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-01 12:18:58] [INFO ] Invariant cache hit.
[2024-06-01 12:18:58] [INFO ] State equation strengthened by 47 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-06-01 12:19:00] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:19:00] [INFO ] Deduced a trap composed of 27 places in 46 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, 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, 47/143 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 143 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5923 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 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, 47/143 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 105/248 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 248 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6813 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 2/2 constraints]
After SMT, in 12900ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 12902ms
Starting structural reductions in LTL mode, iteration 1 : 89/135 places, 106/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13241 ms. Remains : 89/135 places, 106/241 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 finished in 13423 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 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 120 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 120 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 120 transition count 150
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 106 transition count 134
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 106 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 106 transition count 128
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 72 place count 99 transition count 121
Iterating global reduction 2 with 7 rules applied. Total rules applied 79 place count 99 transition count 121
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 84 place count 99 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 96 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 96 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 93 place count 93 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 93 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 92 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 92 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 92 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 91 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 91 transition count 106
Applied a total of 102 rules in 8 ms. Remains 91 /135 variables (removed 44) and now considering 106/241 (removed 135) transitions.
// Phase 1: matrix 106 rows 91 cols
[2024-06-01 12:19:11] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 12:19:11] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 12:19:11] [INFO ] Invariant cache hit.
[2024-06-01 12:19:11] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 12:19:11] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-01 12:19:11] [INFO ] Invariant cache hit.
[2024-06-01 12:19:12] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 12:19:14] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:19:14] [INFO ] Deduced a trap composed of 28 places in 66 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, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/197 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 46/144 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 144 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6269 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 46/46 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/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/197 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 46/144 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 105/249 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 12:19:21] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 250 constraints, problems are : Problem set: 0 solved, 105 unsolved in 9036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 3/3 constraints]
After SMT, in 15455ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 15458ms
Starting structural reductions in LTL mode, iteration 1 : 91/135 places, 106/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15896 ms. Remains : 91/135 places, 106/241 transitions.
Stuttering acceptance computed with spot in 244 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-05
Product exploration explored 100000 steps with 22321 reset in 196 ms.
Product exploration explored 100000 steps with 22315 reset in 233 ms.
Computed a total of 20 stabilizing places and 25 stable transitions
Graph (complete) has 291 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 25 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 86 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 75 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (8972 resets) in 330 ms. (120 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1878 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4141 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1884 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1766319 steps, run timeout after 3001 ms. (steps per millisecond=588 ) properties seen :2 out of 3
Probabilistic random walk after 1766319 steps, saw 742702 distinct states, run finished after 3004 ms. (steps per millisecond=587 ) properties seen :2
[2024-06-01 12:19:31] [INFO ] Invariant cache hit.
[2024-06-01 12:19:31] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 74/197 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/91 constraints, ReadFeed: 0/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 finished in 20096 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 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 119 transition count 142
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 119 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 119 transition count 141
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 105 transition count 126
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 105 transition count 126
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 105 transition count 119
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 76 place count 97 transition count 111
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 97 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 90 place count 97 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 94 place count 93 transition count 101
Iterating global reduction 3 with 4 rules applied. Total rules applied 98 place count 93 transition count 101
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 89 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 89 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 87 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 87 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 85 transition count 91
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 85 transition count 91
Applied a total of 116 rules in 19 ms. Remains 85 /135 variables (removed 50) and now considering 91/241 (removed 150) transitions.
// Phase 1: matrix 91 rows 85 cols
[2024-06-01 12:19:31] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 12:19:31] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 12:19:31] [INFO ] Invariant cache hit.
[2024-06-01 12:19:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-01 12:19:32] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-06-01 12:19:32] [INFO ] Redundant transitions in 1 ms returned []
Running 90 sub problems to find dead transitions.
[2024-06-01 12:19:32] [INFO ] Invariant cache hit.
[2024-06-01 12:19:32] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:19:33] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:19:33] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/176 variables, 85/92 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 36/128 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:19:35] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/176 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/176 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 129 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6404 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/176 variables, 85/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 36/129 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 90/219 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/176 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 219 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5859 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 3/3 constraints]
After SMT, in 12389ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 12391ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/135 places, 91/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12832 ms. Remains : 85/135 places, 91/241 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 finished in 12896 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)))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 120 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 120 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 120 transition count 150
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 106 transition count 134
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 106 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 106 transition count 128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 98 transition count 120
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 98 transition count 120
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 98 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 94 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 94 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 90 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 84 transition count 98
Applied a total of 116 rules in 12 ms. Remains 84 /135 variables (removed 51) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-06-01 12:19:44] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 12:19:44] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 12:19:44] [INFO ] Invariant cache hit.
[2024-06-01 12:19:44] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:19:45] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-06-01 12:19:45] [INFO ] Invariant cache hit.
[2024-06-01 12:19:45] [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-06-01 12:19:46] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:19:46] [INFO ] Deduced a trap composed of 25 places in 47 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
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 5638 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 6130 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 11874ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 11877ms
Starting structural reductions in LTL mode, iteration 1 : 84/135 places, 98/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12338 ms. Remains : 84/135 places, 98/241 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 finished in 12443 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 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 120 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 120 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 120 transition count 150
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 106 transition count 134
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 106 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 106 transition count 128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 98 transition count 120
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 98 transition count 120
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 98 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 94 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 94 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 90 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 84 transition count 98
Applied a total of 116 rules in 26 ms. Remains 84 /135 variables (removed 51) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-06-01 12:19:57] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 12:19:57] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-01 12:19:57] [INFO ] Invariant cache hit.
[2024-06-01 12:19:57] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:19:57] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2024-06-01 12:19:57] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 12:19:57] [INFO ] Invariant cache hit.
[2024-06-01 12:19:57] [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-06-01 12:19:59] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:19:59] [INFO ] Deduced a trap composed of 25 places in 58 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
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 5192 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 6349 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 11675ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 11678ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/135 places, 98/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12299 ms. Remains : 84/135 places, 98/241 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-08
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 finished in 12363 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)))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 120 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 120 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 120 transition count 150
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 106 transition count 134
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 106 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 106 transition count 128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 98 transition count 120
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 98 transition count 120
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 98 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 94 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 94 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 90 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 84 transition count 98
Applied a total of 116 rules in 21 ms. Remains 84 /135 variables (removed 51) and now considering 98/241 (removed 143) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-06-01 12:20:09] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 12:20:09] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 12:20:09] [INFO ] Invariant cache hit.
[2024-06-01 12:20:09] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:20:09] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-06-01 12:20:09] [INFO ] Redundant transitions in 0 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 12:20:09] [INFO ] Invariant cache hit.
[2024-06-01 12:20:09] [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-06-01 12:20:11] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:20:11] [INFO ] Deduced a trap composed of 25 places in 57 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 5795 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 5888 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 11819ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 11821ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/135 places, 98/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12261 ms. Remains : 84/135 places, 98/241 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-11
Product exploration explored 100000 steps with 22462 reset in 122 ms.
Product exploration explored 100000 steps with 22460 reset in 132 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.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 193 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 50 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8944 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1890 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1119911 steps, run visited all 1 properties in 1698 ms. (steps per millisecond=659 )
Probabilistic random walk after 1119911 steps, saw 497311 distinct states, run finished after 1698 ms. (steps per millisecond=659 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
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-06-01 12:20:24] [INFO ] Invariant cache hit.
[2024-06-01 12:20:24] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-01 12:20:24] [INFO ] Invariant cache hit.
[2024-06-01 12:20:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:20:24] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-01 12:20:24] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 12:20:24] [INFO ] Invariant cache hit.
[2024-06-01 12:20:24] [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-06-01 12:20:25] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:20:25] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 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 5636 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 6328 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 12046ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 12048ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12431 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 83 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 :[(NOT p0)]
RANDOM walk for 40000 steps (9073 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1906 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1119911 steps, run visited all 1 properties in 1718 ms. (steps per millisecond=651 )
Probabilistic random walk after 1119911 steps, saw 497311 distinct states, run finished after 1718 ms. (steps per millisecond=651 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22324 reset in 126 ms.
Product exploration explored 100000 steps with 22324 reset in 136 ms.
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 3 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-06-01 12:20:38] [INFO ] Invariant cache hit.
[2024-06-01 12:20:39] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 12:20:39] [INFO ] Invariant cache hit.
[2024-06-01 12:20:39] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 12:20:39] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2024-06-01 12:20:39] [INFO ] Redundant transitions in 0 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 12:20:39] [INFO ] Invariant cache hit.
[2024-06-01 12:20:39] [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-06-01 12:20:41] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:20:41] [INFO ] Deduced a trap composed of 25 places in 57 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 5839 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 6962 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 12918ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 12920ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13375 ms. Remains : 84/84 places, 98/98 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 finished in 43039 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(p1)||p0))||F(p2)))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 122 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 122 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 122 transition count 161
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 110 transition count 147
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 110 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 110 transition count 142
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 63 place count 103 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 70 place count 103 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 74 place count 103 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 101 transition count 129
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 101 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 99 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 99 transition count 127
Applied a total of 82 rules in 7 ms. Remains 99 /135 variables (removed 36) and now considering 127/241 (removed 114) transitions.
// Phase 1: matrix 127 rows 99 cols
[2024-06-01 12:20:52] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 12:20:52] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-01 12:20:52] [INFO ] Invariant cache hit.
[2024-06-01 12:20:52] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-01 12:20:52] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-06-01 12:20:52] [INFO ] Invariant cache hit.
[2024-06-01 12:20:53] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 12:20:55] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:20:55] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/226 variables, 99/106 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 62/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/226 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 168 constraints, problems are : Problem set: 0 solved, 126 unsolved in 8403 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/226 variables, 99/106 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 62/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 126/294 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 12:21:05] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 0/226 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 295 constraints, problems are : Problem set: 0 solved, 126 unsolved in 12601 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 3/3 constraints]
After SMT, in 21174ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 21176ms
Starting structural reductions in LTL mode, iteration 1 : 99/135 places, 127/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21764 ms. Remains : 99/135 places, 127/241 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 417 ms.
Product exploration explored 100000 steps with 50000 reset in 368 ms.
Computed a total of 19 stabilizing places and 25 stable transitions
Graph (complete) has 326 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 finished in 22805 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((G(p1)||p0))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 119 transition count 142
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 119 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 119 transition count 141
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 48 place count 104 transition count 124
Iterating global reduction 1 with 15 rules applied. Total rules applied 63 place count 104 transition count 124
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 70 place count 104 transition count 117
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 79 place count 95 transition count 108
Iterating global reduction 2 with 9 rules applied. Total rules applied 88 place count 95 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 94 place count 95 transition count 102
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 99 place count 90 transition count 97
Iterating global reduction 3 with 5 rules applied. Total rules applied 104 place count 90 transition count 97
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 85 transition count 92
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 85 transition count 92
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 82 transition count 89
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 82 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 82 transition count 87
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 125 place count 79 transition count 83
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 77 transition count 81
Applied a total of 132 rules in 24 ms. Remains 77 /135 variables (removed 58) and now considering 81/241 (removed 160) transitions.
// Phase 1: matrix 81 rows 77 cols
[2024-06-01 12:21:15] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 12:21:15] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 12:21:15] [INFO ] Invariant cache hit.
[2024-06-01 12:21:15] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 12:21:15] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-06-01 12:21:15] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 12:21:15] [INFO ] Invariant cache hit.
[2024-06-01 12:21:15] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 12:21:16] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:21:16] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 116 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4201 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 80/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4557 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 8821ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 8822ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/135 places, 81/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9180 ms. Remains : 77/135 places, 81/241 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-13
Product exploration explored 100000 steps with 22983 reset in 213 ms.
Product exploration explored 100000 steps with 22877 reset in 584 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 240 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 124 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9020 resets) in 101 ms. (392 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1927 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
[2024-06-01 12:21:25] [INFO ] Invariant cache hit.
[2024-06-01 12:21:25] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 62/158 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/77 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 251 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 77 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-06-01 12:21:26] [INFO ] Invariant cache hit.
[2024-06-01 12:21:26] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 12:21:26] [INFO ] Invariant cache hit.
[2024-06-01 12:21:26] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 12:21:26] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-06-01 12:21:26] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 12:21:26] [INFO ] Invariant cache hit.
[2024-06-01 12:21:26] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 12:21:27] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:21:27] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 116 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4322 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 80/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4684 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 9082ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 9084ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9487 ms. Remains : 77/77 places, 81/81 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 240 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 166 steps (37 resets) in 4 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22982 reset in 102 ms.
Product exploration explored 100000 steps with 23029 reset in 120 ms.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-06-01 12:21:36] [INFO ] Invariant cache hit.
[2024-06-01 12:21:36] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 12:21:36] [INFO ] Invariant cache hit.
[2024-06-01 12:21:36] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 12:21:36] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-06-01 12:21:36] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 12:21:36] [INFO ] Invariant cache hit.
[2024-06-01 12:21:36] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 12:21:37] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:21:37] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 116 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3053 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 80/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4236 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 7357ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 7360ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7643 ms. Remains : 77/77 places, 81/81 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-13 finished in 28779 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||G(F(p1))))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 159
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 108 transition count 144
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 108 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 108 transition count 139
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 101 transition count 132
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 101 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 101 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 98 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 98 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 95 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 91 transition count 117
Applied a total of 98 rules in 14 ms. Remains 91 /135 variables (removed 44) and now considering 117/241 (removed 124) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-06-01 12:21:43] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 12:21:44] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-01 12:21:44] [INFO ] Invariant cache hit.
[2024-06-01 12:21:44] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 12:21:44] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-06-01 12:21:44] [INFO ] Invariant cache hit.
[2024-06-01 12:21:44] [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-06-01 12:21:45] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:21:45] [INFO ] Deduced a trap composed of 27 places in 37 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
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 5532 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 7689 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 13328ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 13331ms
Starting structural reductions in LTL mode, iteration 1 : 91/135 places, 117/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13760 ms. Remains : 91/135 places, 117/241 transitions.
Stuttering acceptance computed with spot in 156 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-d1m36-LTLFireability-14
Product exploration explored 100000 steps with 22568 reset in 277 ms.
Product exploration explored 100000 steps with 22442 reset in 302 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) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (9035 resets) in 284 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1899 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1836 resets) in 174 ms. (228 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1913 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1907 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1945 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1380765 steps, run timeout after 3001 ms. (steps per millisecond=460 ) properties seen :4 out of 5
Probabilistic random walk after 1380765 steps, saw 606547 distinct states, run finished after 3001 ms. (steps per millisecond=460 ) properties seen :4
[2024-06-01 12:22:02] [INFO ] Invariant cache hit.
[2024-06-01 12:22:02] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 3/208 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/91 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 412 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
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 4 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-06-01 12:22:03] [INFO ] Invariant cache hit.
[2024-06-01 12:22:03] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 12:22:03] [INFO ] Invariant cache hit.
[2024-06-01 12:22:03] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 12:22:03] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-06-01 12:22:03] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-06-01 12:22:03] [INFO ] Invariant cache hit.
[2024-06-01 12:22:03] [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-06-01 12:22:06] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:22:06] [INFO ] Deduced a trap composed of 27 places in 65 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
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 7703 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 7667 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 15535ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 15538ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16100 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.0 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 201 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (8958 resets) in 298 ms. (133 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1877 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1885 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1904 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1878 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1365572 steps, run timeout after 3001 ms. (steps per millisecond=455 ) properties seen :4 out of 5
Probabilistic random walk after 1365572 steps, saw 599307 distinct states, run finished after 3001 ms. (steps per millisecond=455 ) properties seen :4
[2024-06-01 12:22:23] [INFO ] Invariant cache hit.
[2024-06-01 12:22:23] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 3/208 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/91 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 307 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 22384 reset in 173 ms.
Product exploration explored 100000 steps with 22454 reset in 190 ms.
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 3 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-06-01 12:22:24] [INFO ] Invariant cache hit.
[2024-06-01 12:22:24] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-01 12:22:24] [INFO ] Invariant cache hit.
[2024-06-01 12:22:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 12:22:24] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2024-06-01 12:22:24] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2024-06-01 12:22:24] [INFO ] Invariant cache hit.
[2024-06-01 12:22:24] [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-06-01 12:22:27] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:22:27] [INFO ] Deduced a trap composed of 27 places in 65 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 7842 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 7037 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 14990ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 14993ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15430 ms. Remains : 91/91 places, 117/117 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 finished in 55972 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' '!((p0 U G((!p1&&X((!p1 U (!p2||G(!p1))))))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 159
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 41 place count 109 transition count 146
Iterating global reduction 1 with 12 rules applied. Total rules applied 53 place count 109 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 58 place count 109 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 101 transition count 133
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 101 transition count 133
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 79 place count 101 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 97 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 97 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 93 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 93 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 91 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 91 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 102 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 104 place count 89 transition count 112
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 88 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 88 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 87 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 87 transition count 110
Applied a total of 110 rules in 26 ms. Remains 87 /135 variables (removed 48) and now considering 110/241 (removed 131) transitions.
// Phase 1: matrix 110 rows 87 cols
[2024-06-01 12:22:39] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 12:22:40] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 12:22:40] [INFO ] Invariant cache hit.
[2024-06-01 12:22:40] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 12:22:40] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2024-06-01 12:22:40] [INFO ] Redundant transitions in 0 ms returned []
Running 109 sub problems to find dead transitions.
[2024-06-01 12:22:40] [INFO ] Invariant cache hit.
[2024-06-01 12:22:40] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-06-01 12:22:42] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:22:42] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/197 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 53/147 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 147 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6669 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/197 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 53/147 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 109/256 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 256 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6867 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
After SMT, in 13690ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 13692ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/135 places, 110/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14266 ms. Remains : 87/135 places, 110/241 transitions.
Stuttering acceptance computed with spot in 209 ms :[p1, true, (AND p1 p2), p1, (AND p1 p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-15
Product exploration explored 100000 steps with 22443 reset in 150 ms.
Product exploration explored 100000 steps with 22474 reset in 174 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 286 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 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 194 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[true, p1]
RANDOM walk for 40000 steps (9032 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1888 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4088 steps, run visited all 1 properties in 15 ms. (steps per millisecond=272 )
Probabilistic random walk after 4088 steps, saw 1897 distinct states, run finished after 16 ms. (steps per millisecond=255 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 25 factoid took 244 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-15 finished in 15398 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(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&(X(G(!p0))||G(!p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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((G(p1)||p0))))'
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||G(F(p1))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-14
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 121 transition count 159
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 108 transition count 144
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 108 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 108 transition count 139
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 101 transition count 132
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 101 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 101 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 98 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 98 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 95 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 91 transition count 117
Applied a total of 98 rules in 33 ms. Remains 91 /135 variables (removed 44) and now considering 117/241 (removed 124) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-06-01 12:22:56] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 12:22:56] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 12:22:56] [INFO ] Invariant cache hit.
[2024-06-01 12:22:56] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 12:22:57] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-06-01 12:22:57] [INFO ] Invariant cache hit.
[2024-06-01 12:22:57] [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-06-01 12:22:58] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:22:58] [INFO ] Deduced a trap composed of 27 places in 62 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 6411 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 6584 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 13102ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 13104ms
Starting structural reductions in LI_LTL mode, iteration 1 : 91/135 places, 117/241 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 13634 ms. Remains : 91/135 places, 117/241 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-14
Product exploration explored 100000 steps with 22505 reset in 160 ms.
Product exploration explored 100000 steps with 22540 reset in 177 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) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (8965 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1895 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1903 resets) in 58 ms. (678 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (1854 resets) in 48 ms. (816 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1964 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1566763 steps, run timeout after 3001 ms. (steps per millisecond=522 ) properties seen :4 out of 5
Probabilistic random walk after 1566763 steps, saw 684019 distinct states, run finished after 3002 ms. (steps per millisecond=521 ) properties seen :4
[2024-06-01 12:23:13] [INFO ] Invariant cache hit.
[2024-06-01 12:23:13] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 3/208 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/91 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 239 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
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 2 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-06-01 12:23:14] [INFO ] Invariant cache hit.
[2024-06-01 12:23:14] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 12:23:14] [INFO ] Invariant cache hit.
[2024-06-01 12:23:14] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 12:23:14] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-06-01 12:23:14] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-06-01 12:23:14] [INFO ] Invariant cache hit.
[2024-06-01 12:23:14] [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-06-01 12:23:16] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:23:16] [INFO ] Deduced a trap composed of 27 places in 37 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
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 4918 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 8894 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 13913ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 13915ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14289 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.0 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 129 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (9065 resets) in 264 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1907 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1864 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1916 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1914 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1914 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1308025 steps, run timeout after 3001 ms. (steps per millisecond=435 ) properties seen :4 out of 5
Probabilistic random walk after 1308025 steps, saw 576768 distinct states, run finished after 3001 ms. (steps per millisecond=435 ) properties seen :4
[2024-06-01 12:23:32] [INFO ] Invariant cache hit.
[2024-06-01 12:23:32] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 3/208 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/91 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 428 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 22277 reset in 279 ms.
Product exploration explored 100000 steps with 22423 reset in 298 ms.
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 4 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-06-01 12:23:34] [INFO ] Invariant cache hit.
[2024-06-01 12:23:34] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 12:23:34] [INFO ] Invariant cache hit.
[2024-06-01 12:23:34] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 12:23:34] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2024-06-01 12:23:34] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2024-06-01 12:23:34] [INFO ] Invariant cache hit.
[2024-06-01 12:23:34] [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-06-01 12:23:37] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:23:37] [INFO ] Deduced a trap composed of 27 places in 70 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
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 6866 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 7914 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 14992ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 14995ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15613 ms. Remains : 91/91 places, 117/117 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 finished in 53739 ms.
[2024-06-01 12:23:49] [INFO ] Flatten gal took : 28 ms
[2024-06-01 12:23:49] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 12:23:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 241 transitions and 951 arcs took 10 ms.
Total runtime 551007 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717245107860

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name SieveSingleMsgMbox-PT-d1m36-LTLFireability-00
ltl formula formula --ltl=/tmp/2300/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 241 transitions and 951 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2300/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2300/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2300/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2300/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 136 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 247 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~96!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1156
pnml2lts-mc( 0/ 4): unique states count: 1353
pnml2lts-mc( 0/ 4): unique transitions count: 4087
pnml2lts-mc( 0/ 4): - self-loop count: 1956
pnml2lts-mc( 0/ 4): - claim dead count: 262
pnml2lts-mc( 0/ 4): - claim found count: 9
pnml2lts-mc( 0/ 4): - claim success count: 1440
pnml2lts-mc( 0/ 4): - cum. max stack depth: 284
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1440 states 4437 transitions, fanout: 3.081
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 48000, Transitions per second: 147900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 13.9 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 243 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name SieveSingleMsgMbox-PT-d1m36-LTLFireability-03
ltl formula formula --ltl=/tmp/2300/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 241 transitions and 951 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2300/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2300/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2300/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2300/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 137 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 250 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~91 levels ~10000 states ~29996 transitions
pnml2lts-mc( 2/ 4): ~136 levels ~20000 states ~59460 transitions
pnml2lts-mc( 2/ 4): ~180 levels ~40000 states ~119760 transitions
pnml2lts-mc( 2/ 4): ~224 levels ~80000 states ~242240 transitions
pnml2lts-mc( 2/ 4): ~224 levels ~160000 states ~487532 transitions
pnml2lts-mc( 2/ 4): ~268 levels ~320000 states ~981936 transitions
pnml2lts-mc( 2/ 4): ~312 levels ~640000 states ~1978940 transitions
pnml2lts-mc( 2/ 4): ~400 levels ~1280000 states ~3978748 transitions
pnml2lts-mc( 2/ 4): ~444 levels ~2560000 states ~7999736 transitions
pnml2lts-mc( 0/ 4): ~1029 levels ~5120000 states ~15620764 transitions
pnml2lts-mc( 0/ 4): ~1205 levels ~10240000 states ~31305056 transitions
pnml2lts-mc( 0/ 4): ~7181 levels ~20480000 states ~62709724 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33019528
pnml2lts-mc( 0/ 4): unique states count: 33115389
pnml2lts-mc( 0/ 4): unique transitions count: 105675725
pnml2lts-mc( 0/ 4): - self-loop count: 55446943
pnml2lts-mc( 0/ 4): - claim dead count: 16562776
pnml2lts-mc( 0/ 4): - claim found count: 59865
pnml2lts-mc( 0/ 4): - claim success count: 33115869
pnml2lts-mc( 0/ 4): - cum. max stack depth: 86179
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33115869 states 105679101 transitions, fanout: 3.191
pnml2lts-mc( 0/ 4): Total exploration time 137.880 sec (137.820 sec minimum, 137.838 sec on average)
pnml2lts-mc( 0/ 4): States per second: 240179, Transitions per second: 766457
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 279.6MB, 8.7 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/36.0%
pnml2lts-mc( 0/ 4): Stored 243 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 279.6MB (~256.0MB paged-in)
ltl formula name SieveSingleMsgMbox-PT-d1m36-LTLFireability-11
ltl formula formula --ltl=/tmp/2300/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 241 transitions and 951 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2300/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2300/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2300/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2300/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 136 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 247 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~92 levels ~10000 states ~29892 transitions
pnml2lts-mc( 1/ 4): ~186 levels ~20000 states ~60420 transitions
pnml2lts-mc( 1/ 4): ~186 levels ~40000 states ~121560 transitions
pnml2lts-mc( 1/ 4): ~254 levels ~80000 states ~244560 transitions
pnml2lts-mc( 1/ 4): ~322 levels ~160000 states ~492068 transitions
pnml2lts-mc( 1/ 4): ~390 levels ~320000 states ~993692 transitions
pnml2lts-mc( 0/ 4): ~2614 levels ~640000 states ~1951292 transitions
pnml2lts-mc( 0/ 4): ~2614 levels ~1280000 states ~3927244 transitions
pnml2lts-mc( 0/ 4): ~2614 levels ~2560000 states ~7949920 transitions
pnml2lts-mc( 0/ 4): ~2614 levels ~5120000 states ~16111796 transitions
pnml2lts-mc( 0/ 4): ~2665 levels ~10240000 states ~32360912 transitions
pnml2lts-mc( 0/ 4): ~2699 levels ~20480000 states ~65640004 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~2591!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 22319948
pnml2lts-mc( 0/ 4): unique states count: 22325920
pnml2lts-mc( 0/ 4): unique transitions count: 72204629
pnml2lts-mc( 0/ 4): - self-loop count: 36656023
pnml2lts-mc( 0/ 4): - claim dead count: 13199001
pnml2lts-mc( 0/ 4): - claim found count: 808
pnml2lts-mc( 0/ 4): - claim success count: 22326135
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5853
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22326216 states 72206285 transitions, fanout: 3.234
pnml2lts-mc( 0/ 4): Total exploration time 87.190 sec (87.190 sec minimum, 87.190 sec on average)
pnml2lts-mc( 0/ 4): States per second: 256064, Transitions per second: 828149
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 184.3MB, 8.6 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 66.0%/21.0%
pnml2lts-mc( 0/ 4): Stored 243 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 184.3MB (~256.0MB paged-in)
ltl formula name SieveSingleMsgMbox-PT-d1m36-LTLFireability-13
ltl formula formula --ltl=/tmp/2300/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 241 transitions and 951 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2300/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2300/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2300/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2300/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 136 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 250 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~471 levels ~10000 states ~24156 transitions
pnml2lts-mc( 3/ 4): ~989 levels ~20000 states ~49460 transitions
pnml2lts-mc( 2/ 4): ~1255 levels ~40000 states ~98340 transitions
pnml2lts-mc( 2/ 4): ~1359 levels ~80000 states ~183720 transitions
pnml2lts-mc( 2/ 4): ~1541 levels ~160000 states ~354508 transitions
pnml2lts-mc( 2/ 4): ~1905 levels ~320000 states ~695368 transitions
pnml2lts-mc( 2/ 4): ~2231 levels ~640000 states ~1378632 transitions
pnml2lts-mc( 2/ 4): ~2231 levels ~1280000 states ~2769500 transitions
pnml2lts-mc( 2/ 4): ~2231 levels ~2560000 states ~5555040 transitions
pnml2lts-mc( 2/ 4): ~2233 levels ~5120000 states ~11366108 transitions
pnml2lts-mc( 3/ 4): ~12434 levels ~10240000 states ~22777144 transitions
pnml2lts-mc( 3/ 4): ~14241 levels ~20480000 states ~45841524 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 31770301
pnml2lts-mc( 0/ 4): unique states count: 32069882
pnml2lts-mc( 0/ 4): unique transitions count: 73710215
pnml2lts-mc( 0/ 4): - self-loop count: 27508787
pnml2lts-mc( 0/ 4): - claim dead count: 12113783
pnml2lts-mc( 0/ 4): - claim found count: 325201
pnml2lts-mc( 0/ 4): - claim success count: 32070382
pnml2lts-mc( 0/ 4): - cum. max stack depth: 265272
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32070437 states 73713461 transitions, fanout: 2.298
pnml2lts-mc( 0/ 4): Total exploration time 120.610 sec (120.380 sec minimum, 120.483 sec on average)
pnml2lts-mc( 0/ 4): States per second: 265902, Transitions per second: 611172
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 288.3MB, 9.0 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/50.0%
pnml2lts-mc( 0/ 4): Stored 243 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 288.3MB (~256.0MB paged-in)
ltl formula name SieveSingleMsgMbox-PT-d1m36-LTLFireability-14
ltl formula formula --ltl=/tmp/2300/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 241 transitions and 951 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2300/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2300/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2300/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2300/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 137 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 136, there are 252 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~136 levels ~10000 states ~29880 transitions
pnml2lts-mc( 3/ 4): ~180 levels ~20000 states ~59796 transitions
pnml2lts-mc( 3/ 4): ~224 levels ~40000 states ~120088 transitions
pnml2lts-mc( 3/ 4): ~268 levels ~80000 states ~241748 transitions
pnml2lts-mc( 3/ 4): ~312 levels ~160000 states ~486244 transitions
pnml2lts-mc( 3/ 4): ~356 levels ~320000 states ~976260 transitions
pnml2lts-mc( 3/ 4): ~400 levels ~640000 states ~1967604 transitions
pnml2lts-mc( 2/ 4): ~1893 levels ~1280000 states ~3943912 transitions
pnml2lts-mc( 2/ 4): ~1906 levels ~2560000 states ~7929688 transitions
pnml2lts-mc( 2/ 4): ~1906 levels ~5120000 states ~16004720 transitions
pnml2lts-mc( 2/ 4): ~1906 levels ~10240000 states ~32382564 transitions
pnml2lts-mc( 2/ 4): ~2920 levels ~20480000 states ~64278020 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32258772
pnml2lts-mc( 0/ 4): unique states count: 32476500
pnml2lts-mc( 0/ 4): unique transitions count: 103225860
pnml2lts-mc( 0/ 4): - self-loop count: 55920190
pnml2lts-mc( 0/ 4): - claim dead count: 13318687
pnml2lts-mc( 0/ 4): - claim found count: 243453
pnml2lts-mc( 0/ 4): - claim success count: 32478527
pnml2lts-mc( 0/ 4): - cum. max stack depth: 191561
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32478582 states 103241790 transitions, fanout: 3.179
pnml2lts-mc( 0/ 4): Total exploration time 129.660 sec (129.530 sec minimum, 129.577 sec on average)
pnml2lts-mc( 0/ 4): States per second: 250490, Transitions per second: 796250
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 290.3MB, 9.1 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/53.0%
pnml2lts-mc( 0/ 4): Stored 243 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 290.3MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d1m36, 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 r532-smll-171683810700076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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