Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K 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-d0m06-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716876567422

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:09:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 06:09:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:09:29] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-28 06:09:29] [INFO ] Transformed 262 places.
[2024-05-28 06:09:29] [INFO ] Transformed 73 transitions.
[2024-05-28 06:09:29] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 83 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 68 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 68 transition count 71
Applied a total of 6 rules in 37 ms. Remains 68 /72 variables (removed 4) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 68 cols
[2024-05-28 06:09:30] [INFO ] Computed 5 invariants in 17 ms
[2024-05-28 06:09:30] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-28 06:09:30] [INFO ] Invariant cache hit.
[2024-05-28 06:09:30] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-28 06:09:30] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-28 06:09:30] [INFO ] Invariant cache hit.
[2024-05-28 06:09:30] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-28 06:09:31] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 26 ms to minimize.
[2024-05-28 06:09:31] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-28 06:09:31] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 1/68 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-28 06:09:32] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 06:09:32] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-28 06:09:32] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 71/139 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 70 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 108 constraints, problems are : Problem set: 0 solved, 70 unsolved in 3620 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 1/68 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 71/139 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 70/178 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-28 06:09:35] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 179 constraints, problems are : Problem set: 0 solved, 70 unsolved in 4140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 7/7 constraints]
After SMT, in 7976ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 7993ms
Starting structural reductions in LTL mode, iteration 1 : 68/72 places, 71/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8625 ms. Remains : 68/72 places, 71/73 transitions.
Support contains 29 out of 68 places after structural reductions.
[2024-05-28 06:09:38] [INFO ] Flatten gal took : 40 ms
[2024-05-28 06:09:38] [INFO ] Flatten gal took : 15 ms
[2024-05-28 06:09:38] [INFO ] Input system was already deterministic with 71 transitions.
RANDOM walk for 40000 steps (8902 resets) in 1730 ms. (23 steps per ms) remains 17/24 properties
BEST_FIRST walk for 4002 steps (175 resets) in 56 ms. (70 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (177 resets) in 57 ms. (69 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (120 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (442 resets) in 65 ms. (60 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (407 resets) in 44 ms. (88 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (201 resets) in 44 ms. (88 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (385 resets) in 72 ms. (54 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (189 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (164 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (390 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (187 resets) in 19 ms. (200 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (173 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (128 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (437 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (425 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (183 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (195 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
[2024-05-28 06:09:39] [INFO ] Invariant cache hit.
[2024-05-28 06:09:39] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/55 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 3 (OVERLAPS) 8/63 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 70/133 variables, 63/68 constraints. Problems are: Problem set: 3 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 28/96 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/96 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 6/139 variables, 5/101 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 1/102 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/102 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/102 constraints. Problems are: Problem set: 3 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 102 constraints, problems are : Problem set: 3 solved, 13 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 34/52 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 10/62 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 13 unsolved
[2024-05-28 06:09:40] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 70/132 variables, 62/68 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 28/96 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 4/100 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/100 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 7/139 variables, 6/106 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 1/107 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 9/116 constraints. Problems are: Problem set: 3 solved, 13 unsolved
[2024-05-28 06:09:40] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/139 variables, 1/117 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/139 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/139 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 117 constraints, problems are : Problem set: 3 solved, 13 unsolved in 1119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 13/16 constraints, Known Traps: 2/2 constraints]
After SMT, in 1658ms problems are : Problem set: 3 solved, 13 unsolved
Parikh walk visited 2 properties in 3991 ms.
Support contains 16 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 65 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 65 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 64 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 64 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 64 transition count 66
Applied a total of 9 rules in 39 ms. Remains 64 /68 variables (removed 4) and now considering 66/71 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 64/68 places, 66/71 transitions.
RANDOM walk for 40000 steps (8921 resets) in 380 ms. (104 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1268 resets) in 136 ms. (291 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1918 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (4120 resets) in 187 ms. (212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (4097 resets) in 206 ms. (193 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1970 resets) in 168 ms. (236 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1884 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (4197 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (4121 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1982 resets) in 62 ms. (634 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (2012 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
Probably explored full state space saw : 23713 states, properties seen :10
Probabilistic random walk after 61238 steps, saw 23713 distinct states, run finished after 130 ms. (steps per millisecond=471 ) properties seen :10
Explored full state space saw : 23713 states, properties seen :0
Exhaustive walk after 61238 steps, saw 23713 distinct states, run finished after 58 ms. (steps per millisecond=1055 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 12 stable transitions
Graph (complete) has 208 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 17 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 06:09:46] [INFO ] Computed 5 invariants in 5 ms
[2024-05-28 06:09:46] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 06:09:47] [INFO ] Invariant cache hit.
[2024-05-28 06:09:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:09:47] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-28 06:09:47] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:09:47] [INFO ] Invariant cache hit.
[2024-05-28 06:09:47] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:09:47] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:09:47] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:09:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:09:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:09:48] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:09:48] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:09:48] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2597 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 4982ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4984ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5231 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-00
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-00 finished in 5601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0) U !p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 65
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 65
Applied a total of 12 rules in 7 ms. Remains 62 /68 variables (removed 6) and now considering 65/71 (removed 6) transitions.
// Phase 1: matrix 65 rows 62 cols
[2024-05-28 06:09:52] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:09:52] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-28 06:09:52] [INFO ] Invariant cache hit.
[2024-05-28 06:09:52] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:09:52] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-28 06:09:52] [INFO ] Invariant cache hit.
[2024-05-28 06:09:52] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 65/127 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 100 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2367 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:09:55] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/62 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 65/127 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 26/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 64/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 165 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2929 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 8/8 constraints]
After SMT, in 5345ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5348ms
Starting structural reductions in LTL mode, iteration 1 : 62/68 places, 65/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5609 ms. Remains : 62/68 places, 65/71 transitions.
Stuttering acceptance computed with spot in 247 ms :[p1, p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-02
Product exploration explored 100000 steps with 28560 reset in 262 ms.
Product exploration explored 100000 steps with 28616 reset in 210 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 193 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[p1, p1, p1, p1, true, (NOT p0)]
RANDOM walk for 40000 steps (8917 resets) in 406 ms. (98 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4181 resets) in 244 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4102 resets) in 223 ms. (178 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4065 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4121 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
Probably explored full state space saw : 19961 states, properties seen :3
Probabilistic random walk after 50793 steps, saw 19961 distinct states, run finished after 60 ms. (steps per millisecond=846 ) properties seen :3
Explored full state space saw : 19961 states, properties seen :0
Exhaustive walk after 50793 steps, saw 19961 distinct states, run finished after 40 ms. (steps per millisecond=1269 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 157 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-28 06:10:00] [INFO ] Invariant cache hit.
[2024-05-28 06:10:00] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 06:10:00] [INFO ] Invariant cache hit.
[2024-05-28 06:10:00] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:10:00] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-28 06:10:00] [INFO ] Invariant cache hit.
[2024-05-28 06:10:00] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:10:01] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 7 ms to minimize.
[2024-05-28 06:10:01] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:10:01] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:10:01] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:10:01] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:10:01] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:10:01] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 65/127 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 100 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2264 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:10:02] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/62 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 65/127 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 26/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 64/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 165 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2913 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 8/8 constraints]
After SMT, in 5238ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5240ms
Finished structural reductions in LTL mode , in 1 iterations and 5450 ms. Remains : 62/62 places, 65/65 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 193 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[p1, p1, p1, p1, true]
RANDOM walk for 40000 steps (8934 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4119 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 142 steps, run visited all 1 properties in 5 ms. (steps per millisecond=28 )
Probabilistic random walk after 142 steps, saw 84 distinct states, run finished after 12 ms. (steps per millisecond=11 ) properties seen :1
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 163 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 162 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 28551 reset in 100 ms.
Product exploration explored 100000 steps with 28584 reset in 108 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 153 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 65/65 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 63
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 60 transition count 62
Applied a total of 5 rules in 13 ms. Remains 60 /62 variables (removed 2) and now considering 62/65 (removed 3) transitions.
[2024-05-28 06:10:07] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:10:07] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 06:10:07] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:07] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
[2024-05-28 06:10:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-05-28 06:10:07] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
[2024-05-28 06:10:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:08] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:10:08] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2280 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 157 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2875 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 5198ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5200ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/62 places, 62/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5222 ms. Remains : 60/62 places, 62/65 transitions.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 65/65 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 63
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 60 transition count 62
Applied a total of 5 rules in 6 ms. Remains 60 /62 variables (removed 2) and now considering 62/65 (removed 3) transitions.
[2024-05-28 06:10:12] [INFO ] Invariant cache hit.
[2024-05-28 06:10:12] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 06:10:12] [INFO ] Invariant cache hit.
[2024-05-28 06:10:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:10:12] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-28 06:10:12] [INFO ] Invariant cache hit.
[2024-05-28 06:10:12] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:10:13] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
[2024-05-28 06:10:13] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:10:13] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:13] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:10:13] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2188 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 157 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2778 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 5000ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5001ms
Starting structural reductions in LTL mode, iteration 1 : 60/62 places, 62/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5192 ms. Remains : 60/62 places, 62/65 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 finished in 25171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X((G(p1)||X(X(F(p2))))))))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 65
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 61 transition count 63
Applied a total of 15 rules in 8 ms. Remains 61 /68 variables (removed 7) and now considering 63/71 (removed 8) transitions.
// Phase 1: matrix 63 rows 61 cols
[2024-05-28 06:10:17] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 06:10:17] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-28 06:10:17] [INFO ] Invariant cache hit.
[2024-05-28 06:10:17] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:10:17] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-05-28 06:10:17] [INFO ] Invariant cache hit.
[2024-05-28 06:10:17] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 06:10:18] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:10:18] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
[2024-05-28 06:10:18] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:10:18] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:10:18] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 06:10:18] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:10:18] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 63/124 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 99 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 63/124 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 62/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 0/124 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 161 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2968 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 7/7 constraints]
After SMT, in 5373ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 5374ms
Starting structural reductions in LTL mode, iteration 1 : 61/68 places, 63/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5634 ms. Remains : 61/68 places, 63/71 transitions.
Stuttering acceptance computed with spot in 443 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-03 finished in 6102 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 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 6 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 06:10:23] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:10:23] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 06:10:23] [INFO ] Invariant cache hit.
[2024-05-28 06:10:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:10:23] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 06:10:23] [INFO ] Invariant cache hit.
[2024-05-28 06:10:23] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:10:24] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:10:24] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:10:24] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:10:24] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:10:24] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:10:24] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:10:24] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2223 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2716 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 4974ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4977ms
Starting structural reductions in LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5200 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-04 finished in 5402 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 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 12 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:10:29] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:10:29] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 06:10:29] [INFO ] Invariant cache hit.
[2024-05-28 06:10:29] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:10:29] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-28 06:10:29] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 06:10:29] [INFO ] Invariant cache hit.
[2024-05-28 06:10:29] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:29] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:30] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:10:30] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:31] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/122 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:31] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:10:31] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2960 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2461 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 5464ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5465ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5700 ms. Remains : 60/68 places, 62/71 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-05
Product exploration explored 100000 steps with 22381 reset in 182 ms.
Product exploration explored 100000 steps with 22281 reset in 206 ms.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 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)]
RANDOM walk for 37631 steps (8358 resets) in 166 ms. (225 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 133 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 8 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-28 06:10:35] [INFO ] Invariant cache hit.
[2024-05-28 06:10:35] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-28 06:10:35] [INFO ] Invariant cache hit.
[2024-05-28 06:10:35] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:10:35] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-28 06:10:35] [INFO ] Redundant transitions in 0 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 06:10:35] [INFO ] Invariant cache hit.
[2024-05-28 06:10:35] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:36] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:36] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
[2024-05-28 06:10:36] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:37] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/122 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:38] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:10:38] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2445 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 5502ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5503ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5709 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 40 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8962 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 34253 steps (1658 resets) in 51 ms. (658 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 99 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22418 reset in 108 ms.
Product exploration explored 100000 steps with 22416 reset in 298 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-28 06:10:42] [INFO ] Invariant cache hit.
[2024-05-28 06:10:42] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-28 06:10:42] [INFO ] Invariant cache hit.
[2024-05-28 06:10:42] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:10:42] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-28 06:10:42] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 06:10:42] [INFO ] Invariant cache hit.
[2024-05-28 06:10:42] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:42] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:43] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
[2024-05-28 06:10:43] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:44] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/122 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:44] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:10:44] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2978 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2505 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 5530ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5531ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5756 ms. Remains : 60/60 places, 62/62 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-05 finished in 18873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(F(p1)))))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 3 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:10:48] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 06:10:48] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 06:10:48] [INFO ] Invariant cache hit.
[2024-05-28 06:10:48] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:10:48] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-28 06:10:48] [INFO ] Invariant cache hit.
[2024-05-28 06:10:48] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:48] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:10:48] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:10:48] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:10:48] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:10:48] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:49] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:10:49] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2072 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2351 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
After SMT, in 4461ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 4462ms
Starting structural reductions in LTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4674 ms. Remains : 60/68 places, 62/71 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-09
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-09 finished in 4827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p0))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 8 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 06:10:52] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:10:52] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 06:10:52] [INFO ] Invariant cache hit.
[2024-05-28 06:10:52] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:10:53] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-28 06:10:53] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:10:53] [INFO ] Invariant cache hit.
[2024-05-28 06:10:53] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:10:53] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:10:53] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:10:53] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:10:53] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:10:53] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:10:53] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:10:53] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2533 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 4617ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4618ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4863 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-10 finished in 4911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (p1 U p2)))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 8 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:10:57] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:10:57] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 06:10:57] [INFO ] Invariant cache hit.
[2024-05-28 06:10:57] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:10:57] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-28 06:10:57] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 06:10:57] [INFO ] Invariant cache hit.
[2024-05-28 06:10:57] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:58] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:58] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:10:58] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:10:58] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:10:58] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:59] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2314 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:00] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:00] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 62/122 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 25/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 61/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 159 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2657 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 8/8 constraints]
After SMT, in 5009ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5010ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5224 ms. Remains : 60/68 places, 62/71 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-12 finished in 5352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Applied a total of 14 rules in 6 ms. Remains 61 /68 variables (removed 7) and now considering 64/71 (removed 7) transitions.
// Phase 1: matrix 64 rows 61 cols
[2024-05-28 06:11:03] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:11:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 06:11:03] [INFO ] Invariant cache hit.
[2024-05-28 06:11:03] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:11:03] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-28 06:11:03] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-28 06:11:03] [INFO ] Invariant cache hit.
[2024-05-28 06:11:03] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-28 06:11:03] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:11:03] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 64/125 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 98 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 64/125 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 63/161 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 161 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2475 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 6/6 constraints]
After SMT, in 4535ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 4536ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/68 places, 64/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4752 ms. Remains : 61/68 places, 64/71 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 finished in 4871 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 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 12 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 06:11:07] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:11:08] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 06:11:08] [INFO ] Invariant cache hit.
[2024-05-28 06:11:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:11:08] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-28 06:11:08] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:11:08] [INFO ] Invariant cache hit.
[2024-05-28 06:11:08] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:08] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:11:08] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:08] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:08] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:08] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:09] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:09] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2070 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2687 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 4790ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4791ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5024 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-14
Product exploration explored 100000 steps with 22438 reset in 173 ms.
Product exploration explored 100000 steps with 22290 reset in 194 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-28 06:11:13] [INFO ] Invariant cache hit.
[2024-05-28 06:11:13] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 06:11:13] [INFO ] Invariant cache hit.
[2024-05-28 06:11:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:11:13] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-28 06:11:13] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:11:13] [INFO ] Invariant cache hit.
[2024-05-28 06:11:13] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:14] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
[2024-05-28 06:11:14] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:11:14] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:11:14] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:11:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:11:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2050 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2579 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 4668ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4669ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4897 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22522 reset in 107 ms.
Product exploration explored 100000 steps with 22492 reset in 119 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-28 06:11:19] [INFO ] Invariant cache hit.
[2024-05-28 06:11:19] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 06:11:19] [INFO ] Invariant cache hit.
[2024-05-28 06:11:19] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:11:19] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-28 06:11:19] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:11:19] [INFO ] Invariant cache hit.
[2024-05-28 06:11:19] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:20] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:11:20] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:11:20] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:20] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:20] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:20] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:11:20] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2552 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 4632ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4635ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4874 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-14 finished in 16156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 7 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
[2024-05-28 06:11:24] [INFO ] Invariant cache hit.
[2024-05-28 06:11:24] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 06:11:24] [INFO ] Invariant cache hit.
[2024-05-28 06:11:24] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:11:24] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-28 06:11:24] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:11:24] [INFO ] Invariant cache hit.
[2024-05-28 06:11:24] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:24] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2065 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2532 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 4630ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4631ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4855 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-15
Product exploration explored 100000 steps with 22446 reset in 277 ms.
Product exploration explored 100000 steps with 22372 reset in 353 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8953 resets) in 77 ms. (512 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (1911 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
[2024-05-28 06:11:30] [INFO ] Invariant cache hit.
[2024-05-28 06:11:30] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 06:11:30] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/101 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/120 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/101 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/120 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 247ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Graph (complete) has 162 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 58 transition count 59
Applied a total of 3 rules in 7 ms. Remains 58 /59 variables (removed 1) and now considering 59/61 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 58/59 places, 59/61 transitions.
RANDOM walk for 40000 steps (8956 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1918 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1161 steps, run visited all 1 properties in 10 ms. (steps per millisecond=116 )
Probabilistic random walk after 1161 steps, saw 569 distinct states, run finished after 10 ms. (steps per millisecond=116 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 140 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-28 06:11:30] [INFO ] Invariant cache hit.
[2024-05-28 06:11:30] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 06:11:30] [INFO ] Invariant cache hit.
[2024-05-28 06:11:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:11:30] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-28 06:11:30] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:11:30] [INFO ] Invariant cache hit.
[2024-05-28 06:11:30] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:31] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:11:31] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:11:31] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:11:31] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
[2024-05-28 06:11:31] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:31] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:11:31] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2114 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 4628ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4629ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4823 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8877 resets) in 52 ms. (754 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (1857 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
[2024-05-28 06:11:35] [INFO ] Invariant cache hit.
[2024-05-28 06:11:35] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 06:11:35] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/101 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/120 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/101 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/120 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Graph (complete) has 162 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 58 transition count 59
Applied a total of 3 rules in 4 ms. Remains 58 /59 variables (removed 1) and now considering 59/61 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 58/59 places, 59/61 transitions.
RANDOM walk for 40000 steps (8944 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1891 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1161 steps, run visited all 1 properties in 6 ms. (steps per millisecond=193 )
Probabilistic random walk after 1161 steps, saw 569 distinct states, run finished after 6 ms. (steps per millisecond=193 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 22262 reset in 115 ms.
Product exploration explored 100000 steps with 22309 reset in 126 ms.
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-28 06:11:36] [INFO ] Invariant cache hit.
[2024-05-28 06:11:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 06:11:36] [INFO ] Invariant cache hit.
[2024-05-28 06:11:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:11:36] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-28 06:11:36] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:11:36] [INFO ] Invariant cache hit.
[2024-05-28 06:11:36] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:37] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:11:37] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:37] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:37] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:37] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:37] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:37] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2061 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2488 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 4584ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4585ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4782 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-15 finished in 17476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0) U !p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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' '!(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(p0)&&F(G(p1)))))'
[2024-05-28 06:11:42] [INFO ] Flatten gal took : 11 ms
[2024-05-28 06:11:42] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-28 06:11:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 71 transitions and 281 arcs took 6 ms.
Total runtime 132854 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d0m06

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1941
MODEL NAME: /home/mcc/execution/415/model
68 places, 71 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716876704931

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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