Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716933375230

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 21:56:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 21:56:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:56:17] [INFO ] Load time of PNML (sax parser for PT used): 423 ms
[2024-05-28 21:56:17] [INFO ] Transformed 2398 places.
[2024-05-28 21:56:17] [INFO ] Transformed 1954 transitions.
[2024-05-28 21:56:17] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 604 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1984 places in 23 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 954 place count 288 transition count 647
Iterating global reduction 1 with 101 rules applied. Total rules applied 1055 place count 288 transition count 647
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1065 place count 288 transition count 637
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 1139 place count 214 transition count 563
Iterating global reduction 2 with 74 rules applied. Total rules applied 1213 place count 214 transition count 563
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1252 place count 214 transition count 524
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1277 place count 189 transition count 495
Iterating global reduction 3 with 25 rules applied. Total rules applied 1302 place count 189 transition count 495
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 3 with 73 rules applied. Total rules applied 1375 place count 189 transition count 422
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1381 place count 183 transition count 412
Iterating global reduction 4 with 6 rules applied. Total rules applied 1387 place count 183 transition count 412
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1393 place count 177 transition count 406
Iterating global reduction 4 with 6 rules applied. Total rules applied 1399 place count 177 transition count 406
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1402 place count 174 transition count 402
Iterating global reduction 4 with 3 rules applied. Total rules applied 1405 place count 174 transition count 402
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1407 place count 172 transition count 400
Iterating global reduction 4 with 2 rules applied. Total rules applied 1409 place count 172 transition count 400
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1411 place count 170 transition count 398
Iterating global reduction 4 with 2 rules applied. Total rules applied 1413 place count 170 transition count 398
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1414 place count 169 transition count 397
Iterating global reduction 4 with 1 rules applied. Total rules applied 1415 place count 169 transition count 397
Applied a total of 1415 rules in 158 ms. Remains 169 /414 variables (removed 245) and now considering 397/1954 (removed 1557) transitions.
// Phase 1: matrix 397 rows 169 cols
[2024-05-28 21:56:18] [INFO ] Computed 5 invariants in 28 ms
[2024-05-28 21:56:18] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-28 21:56:18] [INFO ] Invariant cache hit.
[2024-05-28 21:56:18] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-28 21:56:19] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-28 21:56:19] [INFO ] Invariant cache hit.
[2024-05-28 21:56:19] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-28 21:56:25] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (OVERLAPS) 1/169 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-28 21:56:30] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 3 ms to minimize.
[2024-05-28 21:56:31] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (OVERLAPS) 397/566 variables, 169/177 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 267/444 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/566 variables, and 444 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 169/169 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (OVERLAPS) 1/169 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (OVERLAPS) 397/566 variables, 169/177 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 267/444 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 396/840 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-28 21:57:09] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
[2024-05-28 21:57:10] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 2 ms to minimize.
[2024-05-28 21:57:10] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 3/843 constraints. Problems are: Problem set: 3 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 843 constraints, problems are : Problem set: 3 solved, 393 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 169/169 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 6/6 constraints]
After SMT, in 61461ms problems are : Problem set: 3 solved, 393 unsolved
Search for dead transitions found 3 dead transitions in 61511ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 169/414 places, 394/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 166 transition count 394
Applied a total of 3 rules in 7 ms. Remains 166 /169 variables (removed 3) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 166 cols
[2024-05-28 21:57:21] [INFO ] Computed 4 invariants in 6 ms
[2024-05-28 21:57:21] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-28 21:57:21] [INFO ] Invariant cache hit.
[2024-05-28 21:57:21] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-28 21:57:22] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 1652 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 166/414 places, 394/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65037 ms. Remains : 166/414 places, 394/1954 transitions.
Support contains 23 out of 166 places after structural reductions.
[2024-05-28 21:57:23] [INFO ] Flatten gal took : 78 ms
[2024-05-28 21:57:23] [INFO ] Flatten gal took : 40 ms
[2024-05-28 21:57:23] [INFO ] Input system was already deterministic with 394 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (9047 resets) in 3190 ms. (12 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (182 resets) in 44 ms. (88 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (184 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (197 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (186 resets) in 52 ms. (75 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (185 resets) in 51 ms. (76 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (207 resets) in 53 ms. (74 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (192 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (195 resets) in 43 ms. (90 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (204 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (197 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (180 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (187 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (181 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (182 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (175 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (185 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (180 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (172 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (167 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (186 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (179 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (188 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (193 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (189 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 218523 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :13 out of 24
Probabilistic random walk after 218523 steps, saw 99820 distinct states, run finished after 3009 ms. (steps per millisecond=72 ) properties seen :13
[2024-05-28 21:57:27] [INFO ] Invariant cache hit.
[2024-05-28 21:57:27] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 78/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 38/129 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-28 21:57:27] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 271/400 variables, 129/134 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 143/277 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 160/560 variables, 37/314 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 123/437 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/560 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 437 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1371 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 166/166 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 78/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 38/129 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 271/400 variables, 129/134 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 143/277 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 160/560 variables, 37/314 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 123/437 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 11/448 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-28 21:57:30] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
[2024-05-28 21:57:30] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 2/450 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/560 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/560 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 450 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3302 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 166/166 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints]
After SMT, in 4759ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 31687 ms.
Support contains 13 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 394/394 transitions.
Graph (complete) has 655 edges and 166 vertex of which 165 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 165 transition count 392
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 157 transition count 288
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 157 transition count 288
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 27 place count 149 transition count 280
Iterating global reduction 1 with 8 rules applied. Total rules applied 35 place count 149 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 41 place count 149 transition count 274
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 145 transition count 266
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 145 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 145 transition count 264
Applied a total of 51 rules in 66 ms. Remains 145 /166 variables (removed 21) and now considering 264/394 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 145/166 places, 264/394 transitions.
RANDOM walk for 40000 steps (8952 resets) in 519 ms. (76 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1893 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1851 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1900 resets) in 72 ms. (547 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1916 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1848 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1866 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1862 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1890 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (1932 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1892 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1909 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 252132 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :1 out of 11
Probabilistic random walk after 252132 steps, saw 110940 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :1
// Phase 1: matrix 264 rows 145 cols
[2024-05-28 21:58:07] [INFO ] Computed 3 invariants in 3 ms
[2024-05-28 21:58:07] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 74/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 231/321 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 125/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 88/409 variables, 55/273 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 33/306 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/409 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 306 constraints, problems are : Problem set: 0 solved, 10 unsolved in 876 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 145/145 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 74/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 231/321 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 125/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 88/409 variables, 55/273 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 33/306 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 10/316 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-28 21:58:09] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/409 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 317 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2960 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 145/145 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 3914ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 21375 ms.
Support contains 12 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 264/264 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 144 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 144 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 143 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 143 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 142 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 142 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 142 transition count 247
Applied a total of 7 rules in 31 ms. Remains 142 /145 variables (removed 3) and now considering 247/264 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 142/145 places, 247/264 transitions.
RANDOM walk for 40000 steps (9007 resets) in 261 ms. (152 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1881 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1825 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1881 resets) in 144 ms. (275 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1852 resets) in 143 ms. (277 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1886 resets) in 144 ms. (275 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1898 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1952 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1877 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1887 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1876 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 229393 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 10
Probabilistic random walk after 229393 steps, saw 100158 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
// Phase 1: matrix 247 rows 142 cols
[2024-05-28 21:58:36] [INFO ] Computed 3 invariants in 8 ms
[2024-05-28 21:58:36] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 73/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 227/316 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 124/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 73/389 variables, 53/269 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 20/289 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 289 constraints, problems are : Problem set: 0 solved, 10 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 142/142 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 73/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 227/316 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 124/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 73/389 variables, 53/269 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 20/289 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 10/299 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-28 21:58:39] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-05-28 21:58:39] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/389 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 301 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3076 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 142/142 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 3913ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 20994 ms.
Support contains 12 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 247/247 transitions.
Applied a total of 0 rules in 13 ms. Remains 142 /142 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 142/142 places, 247/247 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 247/247 transitions.
Applied a total of 0 rules in 12 ms. Remains 142 /142 variables (removed 0) and now considering 247/247 (removed 0) transitions.
[2024-05-28 21:59:01] [INFO ] Invariant cache hit.
[2024-05-28 21:59:01] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-28 21:59:01] [INFO ] Invariant cache hit.
[2024-05-28 21:59:02] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-28 21:59:02] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2024-05-28 21:59:02] [INFO ] Redundant transitions in 12 ms returned []
Running 246 sub problems to find dead transitions.
[2024-05-28 21:59:02] [INFO ] Invariant cache hit.
[2024-05-28 21:59:02] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-28 21:59:06] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Problem TDEAD58 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD226 is UNSAT
At refinement iteration 5 (OVERLAPS) 247/389 variables, 142/146 constraints. Problems are: Problem set: 3 solved, 243 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 144/290 constraints. Problems are: Problem set: 3 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/290 constraints. Problems are: Problem set: 3 solved, 243 unsolved
At refinement iteration 8 (OVERLAPS) 0/389 variables, 0/290 constraints. Problems are: Problem set: 3 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 290 constraints, problems are : Problem set: 3 solved, 243 unsolved in 15838 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 142/142 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 246/385 variables, 139/143 constraints. Problems are: Problem set: 3 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 143/286 constraints. Problems are: Problem set: 3 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 21/307 constraints. Problems are: Problem set: 3 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/307 constraints. Problems are: Problem set: 3 solved, 243 unsolved
At refinement iteration 9 (OVERLAPS) 4/389 variables, 3/310 constraints. Problems are: Problem set: 3 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 1/311 constraints. Problems are: Problem set: 3 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 222/533 constraints. Problems are: Problem set: 3 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 533 constraints, problems are : Problem set: 3 solved, 243 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 142/142 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 243/246 constraints, Known Traps: 1/1 constraints]
After SMT, in 46291ms problems are : Problem set: 3 solved, 243 unsolved
Search for dead transitions found 3 dead transitions in 46294ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 142/142 places, 244/247 transitions.
Graph (complete) has 473 edges and 142 vertex of which 139 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 139 /142 variables (removed 3) and now considering 244/244 (removed 0) transitions.
// Phase 1: matrix 244 rows 139 cols
[2024-05-28 21:59:48] [INFO ] Computed 3 invariants in 10 ms
[2024-05-28 21:59:48] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-28 21:59:48] [INFO ] Invariant cache hit.
[2024-05-28 21:59:49] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-28 21:59:49] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 139/142 places, 244/247 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 48022 ms. Remains : 139/142 places, 244/247 transitions.
Computed a total of 33 stabilizing places and 58 stable transitions
Graph (complete) has 714 edges and 166 vertex of which 165 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 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 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 394/394 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 217
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 149 transition count 216
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 132 transition count 198
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 132 transition count 198
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 74 place count 132 transition count 193
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 87 place count 119 transition count 171
Iterating global reduction 2 with 13 rules applied. Total rules applied 100 place count 119 transition count 171
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 109 place count 119 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 116 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 116 transition count 159
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 113 transition count 156
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 113 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 112 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 112 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 111 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 111 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 110 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 110 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 109 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 109 transition count 150
Applied a total of 129 rules in 44 ms. Remains 109 /166 variables (removed 57) and now considering 150/394 (removed 244) transitions.
// Phase 1: matrix 150 rows 109 cols
[2024-05-28 21:59:50] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:59:50] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-28 21:59:50] [INFO ] Invariant cache hit.
[2024-05-28 21:59:50] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 21:59:50] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-05-28 21:59:50] [INFO ] Redundant transitions in 2 ms returned []
Running 149 sub problems to find dead transitions.
[2024-05-28 21:59:50] [INFO ] Invariant cache hit.
[2024-05-28 21:59:50] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 21:59:53] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD134 is UNSAT
At refinement iteration 6 (OVERLAPS) 150/259 variables, 109/114 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 74/188 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/188 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 0/259 variables, 0/188 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 188 constraints, problems are : Problem set: 3 solved, 146 unsolved in 7137 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 2/108 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 150/258 variables, 108/113 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 74/187 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 18/205 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/205 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 12 (OVERLAPS) 1/259 variables, 1/206 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 128/334 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 0/334 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 15 (OVERLAPS) 0/259 variables, 0/334 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 334 constraints, problems are : Problem set: 3 solved, 146 unsolved in 14762 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 146/149 constraints, Known Traps: 1/1 constraints]
After SMT, in 22199ms problems are : Problem set: 3 solved, 146 unsolved
Search for dead transitions found 3 dead transitions in 22203ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 109/166 places, 147/394 transitions.
Graph (complete) has 361 edges and 109 vertex of which 106 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 106 /109 variables (removed 3) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 106 cols
[2024-05-28 22:00:12] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:00:12] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 22:00:12] [INFO ] Invariant cache hit.
[2024-05-28 22:00:13] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 22:00:13] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/166 places, 147/394 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23226 ms. Remains : 106/166 places, 147/394 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 finished in 23645 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(((p1 U G(p2))&&p0))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 394/394 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 150 transition count 219
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 150 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 150 transition count 218
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 134 transition count 201
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 134 transition count 201
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 134 transition count 195
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 84 place count 121 transition count 172
Iterating global reduction 2 with 13 rules applied. Total rules applied 97 place count 121 transition count 172
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 106 place count 121 transition count 163
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 110 place count 117 transition count 159
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 117 transition count 159
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 114 transition count 156
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 114 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 113 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 113 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 125 place count 113 transition count 152
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 112 transition count 151
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 112 transition count 151
Applied a total of 127 rules in 53 ms. Remains 112 /166 variables (removed 54) and now considering 151/394 (removed 243) transitions.
// Phase 1: matrix 151 rows 112 cols
[2024-05-28 22:00:13] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 22:00:13] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-28 22:00:13] [INFO ] Invariant cache hit.
[2024-05-28 22:00:13] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 22:00:14] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-28 22:00:14] [INFO ] Redundant transitions in 2 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-28 22:00:14] [INFO ] Invariant cache hit.
[2024-05-28 22:00:14] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD136 is UNSAT
At refinement iteration 5 (OVERLAPS) 151/263 variables, 112/116 constraints. Problems are: Problem set: 3 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 73/189 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 189 constraints, problems are : Problem set: 3 solved, 147 unsolved in 5197 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 2/111 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 151/262 variables, 111/115 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 73/188 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 19/207 constraints. Problems are: Problem set: 3 solved, 147 unsolved
[2024-05-28 22:00:22] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 1/208 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/208 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 12 (OVERLAPS) 1/263 variables, 1/209 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 128/337 constraints. Problems are: Problem set: 3 solved, 147 unsolved
[2024-05-28 22:00:30] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 1/338 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/338 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 16 (OVERLAPS) 0/263 variables, 0/338 constraints. Problems are: Problem set: 3 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 338 constraints, problems are : Problem set: 3 solved, 147 unsolved in 24755 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 147/150 constraints, Known Traps: 2/2 constraints]
After SMT, in 30129ms problems are : Problem set: 3 solved, 147 unsolved
Search for dead transitions found 3 dead transitions in 30133ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 112/166 places, 148/394 transitions.
Graph (complete) has 369 edges and 112 vertex of which 109 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 109 /112 variables (removed 3) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 109 cols
[2024-05-28 22:00:44] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 22:00:44] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-28 22:00:44] [INFO ] Invariant cache hit.
[2024-05-28 22:00:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 22:00:44] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/166 places, 148/394 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31165 ms. Remains : 109/166 places, 148/394 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 finished in 31378 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 U (p1||G(!p0))) U ((G(!p2)&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0))))))||p3)))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 394/394 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 217
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 149 transition count 216
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 132 transition count 198
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 132 transition count 198
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 132 transition count 192
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 119 transition count 170
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 119 transition count 170
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 110 place count 119 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 116 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 116 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 113 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 113 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 112 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 112 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 111 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 110 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 110 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 109 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 109 transition count 149
Applied a total of 130 rules in 30 ms. Remains 109 /166 variables (removed 57) and now considering 149/394 (removed 245) transitions.
// Phase 1: matrix 149 rows 109 cols
[2024-05-28 22:00:45] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 22:00:45] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 22:00:45] [INFO ] Invariant cache hit.
[2024-05-28 22:00:45] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 22:00:45] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-05-28 22:00:45] [INFO ] Redundant transitions in 1 ms returned []
Running 148 sub problems to find dead transitions.
[2024-05-28 22:00:45] [INFO ] Invariant cache hit.
[2024-05-28 22:00:45] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 5 (OVERLAPS) 149/258 variables, 109/113 constraints. Problems are: Problem set: 3 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 74/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 187 constraints, problems are : Problem set: 3 solved, 145 unsolved in 6594 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 2/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 149/257 variables, 108/112 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 74/186 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 18/204 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 1/258 variables, 1/205 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 127/332 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/332 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/332 constraints. Problems are: Problem set: 3 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 332 constraints, problems are : Problem set: 3 solved, 145 unsolved in 17854 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 145/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 24621ms problems are : Problem set: 3 solved, 145 unsolved
Search for dead transitions found 3 dead transitions in 24623ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 109/166 places, 146/394 transitions.
Graph (complete) has 360 edges and 109 vertex of which 106 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 106 /109 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-28 22:01:10] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:01:10] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 22:01:10] [INFO ] Invariant cache hit.
[2024-05-28 22:01:10] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 22:01:10] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/166 places, 146/394 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25671 ms. Remains : 106/166 places, 146/394 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) p2 (NOT p3) p0), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-02
Product exploration explored 100000 steps with 22312 reset in 478 ms.
Product exploration explored 100000 steps with 22558 reset in 446 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 358 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0 p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 269 ms. Reduced automaton from 3 states, 10 edges and 4 AP (stutter insensitive) to 3 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) p2 (NOT p3) p0), (AND p0 (NOT p1) (NOT p3))]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (8938 resets) in 406 ms. (98 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1819 resets) in 261 ms. (152 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1994 resets) in 900 ms. (44 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1897 resets) in 371 ms. (107 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1835 resets) in 424 ms. (94 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1839 resets) in 261 ms. (152 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1843 resets) in 278 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1804 resets) in 184 ms. (216 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1890 resets) in 233 ms. (170 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1903 resets) in 221 ms. (180 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1859 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 239347 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :3 out of 10
Probabilistic random walk after 239347 steps, saw 110104 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :3
[2024-05-28 22:01:16] [INFO ] Invariant cache hit.
[2024-05-28 22:01:16] [INFO ] State equation strengthened by 73 read => feed constraints.
Problem apf5 is UNSAT
Problem apf10 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/56 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 22/78 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 127/205 variables, 78/82 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 54/136 constraints. Problems are: Problem set: 2 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 47/252 variables, 28/164 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 19/183 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/183 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/252 variables, 0/183 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 183 constraints, problems are : Problem set: 2 solved, 5 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-28 22:01:17] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/56 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 22/78 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 127/205 variables, 78/83 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 54/137 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/137 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 47/252 variables, 28/165 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 19/184 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 5/189 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 0/189 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/252 variables, 0/189 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 189 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1561 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 1953ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3857 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 146/146 transitions.
Graph (complete) has 321 edges and 106 vertex of which 105 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 105 transition count 144
Applied a total of 3 rules in 6 ms. Remains 105 /106 variables (removed 1) and now considering 144/146 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 105/106 places, 144/146 transitions.
RANDOM walk for 40000 steps (8975 resets) in 374 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1905 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1891 resets) in 208 ms. (191 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1865 resets) in 308 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1813 resets) in 194 ms. (205 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1853 resets) in 185 ms. (215 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 130869 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 5
Probabilistic random walk after 130869 steps, saw 61456 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
// Phase 1: matrix 144 rows 105 cols
[2024-05-28 22:01:26] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 22:01:26] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/60 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 125/185 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 64/249 variables, 45/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 19/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 179 constraints, problems are : Problem set: 0 solved, 5 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/60 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 125/185 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 64/249 variables, 45/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 19/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 5/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 184 constraints, problems are : Problem set: 0 solved, 5 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1176ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1503 ms.
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 144/144 transitions.
Applied a total of 0 rules in 13 ms. Remains 105 /105 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 105/105 places, 144/144 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-28 22:01:28] [INFO ] Invariant cache hit.
[2024-05-28 22:01:29] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-28 22:01:29] [INFO ] Invariant cache hit.
[2024-05-28 22:01:29] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-28 22:01:29] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-05-28 22:01:29] [INFO ] Redundant transitions in 1 ms returned []
Running 143 sub problems to find dead transitions.
[2024-05-28 22:01:29] [INFO ] Invariant cache hit.
[2024-05-28 22:01:29] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/249 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 71/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 179 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5402 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/249 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 71/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 143/322 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 322 constraints, problems are : Problem set: 0 solved, 143 unsolved in 12784 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
After SMT, in 18460ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 18464ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18932 ms. Remains : 105/105 places, 144/144 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 105 transition count 137
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 99 transition count 137
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 99 transition count 122
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 84 transition count 122
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 77 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 76 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 76 transition count 125
Applied a total of 60 rules in 21 ms. Remains 76 /105 variables (removed 29) and now considering 125/144 (removed 19) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 125 rows 76 cols
[2024-05-28 22:01:47] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 22:01:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 22:01:48] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-28 22:01:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 22:01:48] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-28 22:01:48] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-28 22:01:48] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 735 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0 p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p3))))), (G (OR p1 p2 p3 (NOT p0))), (G (OR p1 p2 p3 p0))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0))))), (F p3), (F (NOT p1))]
Knowledge based reduction with 25 factoid took 276 ms. Reduced automaton from 3 states, 10 edges and 4 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND p0 (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND p0 (NOT p3) (NOT p1))]
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 146/146 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-28 22:01:48] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:01:49] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 22:01:49] [INFO ] Invariant cache hit.
[2024-05-28 22:01:49] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 22:01:49] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2024-05-28 22:01:49] [INFO ] Redundant transitions in 1 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-28 22:01:49] [INFO ] Invariant cache hit.
[2024-05-28 22:01:49] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 146/252 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 73/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 183 constraints, problems are : Problem set: 0 solved, 145 unsolved in 5714 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-28 22:01:56] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/252 variables, 106/111 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 73/184 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 145/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 329 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12915 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 1/1 constraints]
After SMT, in 18801ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 18803ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19329 ms. Remains : 106/106 places, 146/146 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 358 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND p0 (NOT p3) (NOT p1))]
RANDOM walk for 40000 steps (8959 resets) in 1242 ms. (32 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1851 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1899 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1849 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1922 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1917 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 430798 steps, run timeout after 3002 ms. (steps per millisecond=143 ) properties seen :3 out of 5
Probabilistic random walk after 430798 steps, saw 197463 distinct states, run finished after 3002 ms. (steps per millisecond=143 ) properties seen :3
[2024-05-28 22:02:12] [INFO ] Invariant cache hit.
[2024-05-28 22:02:12] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/78 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 127/205 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 54/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 47/252 variables, 28/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 19/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 183 constraints, problems are : Problem set: 0 solved, 2 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/78 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 127/205 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 54/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 47/252 variables, 28/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 19/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/252 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 185 constraints, problems are : Problem set: 0 solved, 2 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 594ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 924 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 146/146 transitions.
Graph (complete) has 321 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 144
Applied a total of 3 rules in 6 ms. Remains 105 /106 variables (removed 1) and now considering 144/146 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 105/106 places, 144/146 transitions.
RANDOM walk for 40000 steps (8922 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1921 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1823 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 536164 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 2
Probabilistic random walk after 536164 steps, saw 244794 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
// Phase 1: matrix 144 rows 105 cols
[2024-05-28 22:02:16] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 22:02:16] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/60 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/185 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/249 variables, 45/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 19/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/60 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/185 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/249 variables, 45/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 19/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 637ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1434 ms.
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 105/105 places, 144/144 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-28 22:02:18] [INFO ] Invariant cache hit.
[2024-05-28 22:02:19] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 22:02:19] [INFO ] Invariant cache hit.
[2024-05-28 22:02:19] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-28 22:02:19] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-05-28 22:02:19] [INFO ] Redundant transitions in 0 ms returned []
Running 143 sub problems to find dead transitions.
[2024-05-28 22:02:19] [INFO ] Invariant cache hit.
[2024-05-28 22:02:19] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/249 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 71/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 179 constraints, problems are : Problem set: 0 solved, 143 unsolved in 6702 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/249 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 71/179 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 143/322 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 322 constraints, problems are : Problem set: 0 solved, 143 unsolved in 13582 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
After SMT, in 20462ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 20464ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20935 ms. Remains : 105/105 places, 144/144 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 105 transition count 137
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 99 transition count 137
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 99 transition count 122
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 84 transition count 122
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 77 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 76 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 76 transition count 125
Applied a total of 60 rules in 15 ms. Remains 76 /105 variables (removed 29) and now considering 125/144 (removed 19) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 125 rows 76 cols
[2024-05-28 22:02:39] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 22:02:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 22:02:40] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 22:02:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 22:02:40] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 22:02:40] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 22:02:40] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 401 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p3), (F (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1))))]
Knowledge based reduction with 11 factoid took 277 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND p0 (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND p0 (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND p0 (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 22516 reset in 294 ms.
Product exploration explored 100000 steps with 22416 reset in 321 ms.
Built C files in :
/tmp/ltsmin2702395534459698415
[2024-05-28 22:02:41] [INFO ] Computing symmetric may disable matrix : 146 transitions.
[2024-05-28 22:02:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:02:41] [INFO ] Computing symmetric may enable matrix : 146 transitions.
[2024-05-28 22:02:41] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:02:41] [INFO ] Computing Do-Not-Accords matrix : 146 transitions.
[2024-05-28 22:02:41] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:02:41] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2702395534459698415
Running compilation step : cd /tmp/ltsmin2702395534459698415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1220 ms.
Running link step : cd /tmp/ltsmin2702395534459698415;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin2702395534459698415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7623991172798364924.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 146/146 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-28 22:02:56] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 22:02:56] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-28 22:02:56] [INFO ] Invariant cache hit.
[2024-05-28 22:02:56] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 22:02:56] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-05-28 22:02:56] [INFO ] Redundant transitions in 1 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-28 22:02:56] [INFO ] Invariant cache hit.
[2024-05-28 22:02:56] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 146/252 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 73/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 183 constraints, problems are : Problem set: 0 solved, 145 unsolved in 6805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-28 22:03:05] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/252 variables, 106/111 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 73/184 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 145/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 329 constraints, problems are : Problem set: 0 solved, 145 unsolved in 13245 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 1/1 constraints]
After SMT, in 20346ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 20350ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20846 ms. Remains : 106/106 places, 146/146 transitions.
Built C files in :
/tmp/ltsmin17833629087721480792
[2024-05-28 22:03:17] [INFO ] Computing symmetric may disable matrix : 146 transitions.
[2024-05-28 22:03:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:03:17] [INFO ] Computing symmetric may enable matrix : 146 transitions.
[2024-05-28 22:03:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:03:17] [INFO ] Computing Do-Not-Accords matrix : 146 transitions.
[2024-05-28 22:03:17] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:03:17] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17833629087721480792
Running compilation step : cd /tmp/ltsmin17833629087721480792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 866 ms.
Running link step : cd /tmp/ltsmin17833629087721480792;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17833629087721480792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16434005232740704879.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 22:03:32] [INFO ] Flatten gal took : 15 ms
[2024-05-28 22:03:32] [INFO ] Flatten gal took : 13 ms
[2024-05-28 22:03:32] [INFO ] Time to serialize gal into /tmp/LTL3900494640962654603.gal : 4 ms
[2024-05-28 22:03:32] [INFO ] Time to serialize properties into /tmp/LTL5478393900218427934.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3900494640962654603.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7210553857105105773.hoa' '-atoms' '/tmp/LTL5478393900218427934.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((((!("(((s1>=1)&&(l2237>=1))&&((s1>=1)&&(l1699>=1)))"))U(("((!(((s1>=1)&&(l2237>=1))||((s1>=1)&&(l2220>=1))))&&(!(((s1>=1)&&(l223...767
Formula 0 simplified : G(!"((s1>=1)&&(l2220>=1))" & (("(((s1>=1)&&(l2237>=1))&&((s1>=1)&&(l1699>=1)))" M !"((!(((s1>=1)&&(l2237>=1))||((s1>=1)&&(l2220>=1))...567
Detected timeout of ITS tools.
[2024-05-28 22:04:02] [INFO ] Flatten gal took : 11 ms
[2024-05-28 22:04:02] [INFO ] Applying decomposition
[2024-05-28 22:04:02] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6403953800580489609.txt' '-o' '/tmp/graph6403953800580489609.bin' '-w' '/tmp/graph6403953800580489609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6403953800580489609.bin' '-l' '-1' '-v' '-w' '/tmp/graph6403953800580489609.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:04:02] [INFO ] Decomposing Gal with order
[2024-05-28 22:04:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:04:02] [INFO ] Removed a total of 105 redundant transitions.
[2024-05-28 22:04:02] [INFO ] Flatten gal took : 87 ms
[2024-05-28 22:04:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 13 ms.
[2024-05-28 22:04:02] [INFO ] Time to serialize gal into /tmp/LTL6124035155407758947.gal : 6 ms
[2024-05-28 22:04:02] [INFO ] Time to serialize properties into /tmp/LTL14065999234487545656.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6124035155407758947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14065999234487545656.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((((!("(((u0.s1>=1)&&(u0.l2237>=1))&&((u0.s1>=1)&&(i1.u2.l1699>=1)))"))U(("((!(((u0.s1>=1)&&(u0.l2237>=1))||((u0.s1>=1)&&(u0.l2220...950
Formula 0 simplified : G(!"((u0.s1>=1)&&(u0.l2220>=1))" & (("(((u0.s1>=1)&&(u0.l2237>=1))&&((u0.s1>=1)&&(i1.u2.l1699>=1)))" M !"((!(((u0.s1>=1)&&(u0.l2237>...705
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-02 finished in 213070 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((F(p1)||(!p2 U (p3||G(!p2)))))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 394/394 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 217
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 149 transition count 216
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 132 transition count 198
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 132 transition count 198
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 132 transition count 192
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 119 transition count 170
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 119 transition count 170
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 110 place count 119 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 116 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 116 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 113 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 113 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 112 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 112 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 111 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 110 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 110 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 109 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 109 transition count 149
Applied a total of 130 rules in 17 ms. Remains 109 /166 variables (removed 57) and now considering 149/394 (removed 245) transitions.
// Phase 1: matrix 149 rows 109 cols
[2024-05-28 22:04:18] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:04:18] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-28 22:04:18] [INFO ] Invariant cache hit.
[2024-05-28 22:04:18] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 22:04:18] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2024-05-28 22:04:18] [INFO ] Invariant cache hit.
[2024-05-28 22:04:18] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 5 (OVERLAPS) 149/258 variables, 109/113 constraints. Problems are: Problem set: 3 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 74/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 187 constraints, problems are : Problem set: 3 solved, 145 unsolved in 5599 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 2/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 149/257 variables, 108/112 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 74/186 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 18/204 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 1/258 variables, 1/205 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 127/332 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/332 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/332 constraints. Problems are: Problem set: 3 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 332 constraints, problems are : Problem set: 3 solved, 145 unsolved in 17634 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 145/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 23555ms problems are : Problem set: 3 solved, 145 unsolved
Search for dead transitions found 3 dead transitions in 23559ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 109/166 places, 146/394 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 106 transition count 146
Applied a total of 3 rules in 1 ms. Remains 106 /109 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-28 22:04:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:04:42] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 22:04:42] [INFO ] Invariant cache hit.
[2024-05-28 22:04:42] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 22:04:42] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/166 places, 146/394 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24529 ms. Remains : 106/166 places, 146/394 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3) p2), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-04
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 finished in 24738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 394/394 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 205
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 205
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 132 transition count 188
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 132 transition count 188
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 75 place count 132 transition count 181
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 88 place count 119 transition count 158
Iterating global reduction 1 with 13 rules applied. Total rules applied 101 place count 119 transition count 158
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 111 place count 119 transition count 148
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 116 transition count 145
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 116 transition count 145
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 120 place count 113 transition count 142
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 113 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 112 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 112 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 112 transition count 139
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 111 transition count 138
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 111 transition count 138
Applied a total of 129 rules in 8 ms. Remains 111 /166 variables (removed 55) and now considering 138/394 (removed 256) transitions.
// Phase 1: matrix 138 rows 111 cols
[2024-05-28 22:04:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:04:42] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 22:04:42] [INFO ] Invariant cache hit.
[2024-05-28 22:04:43] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 22:04:43] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2024-05-28 22:04:43] [INFO ] Invariant cache hit.
[2024-05-28 22:04:43] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 5 (OVERLAPS) 138/249 variables, 111/115 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 61/176 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 176 constraints, problems are : Problem set: 3 solved, 134 unsolved in 4797 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 2/110 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 138/248 variables, 110/114 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 61/175 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 18/193 constraints. Problems are: Problem set: 3 solved, 134 unsolved
[2024-05-28 22:04:50] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 1/194 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 1/249 variables, 1/195 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 116/311 constraints. Problems are: Problem set: 3 solved, 134 unsolved
[2024-05-28 22:04:56] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 1/312 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 0/312 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 16 (OVERLAPS) 0/249 variables, 0/312 constraints. Problems are: Problem set: 3 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 312 constraints, problems are : Problem set: 3 solved, 134 unsolved in 19626 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 134/137 constraints, Known Traps: 2/2 constraints]
After SMT, in 24590ms problems are : Problem set: 3 solved, 134 unsolved
Search for dead transitions found 3 dead transitions in 24592ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 111/166 places, 135/394 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 108 transition count 135
Applied a total of 3 rules in 1 ms. Remains 108 /111 variables (removed 3) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 108 cols
[2024-05-28 22:05:07] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:05:08] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 22:05:08] [INFO ] Invariant cache hit.
[2024-05-28 22:05:08] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 22:05:08] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 108/166 places, 135/394 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25551 ms. Remains : 108/166 places, 135/394 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-05
Product exploration explored 100000 steps with 22254 reset in 327 ms.
Product exploration explored 100000 steps with 22373 reset in 247 ms.
Computed a total of 23 stabilizing places and 30 stable transitions
Graph (complete) has 353 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8995 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1920 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1714753 steps, run timeout after 3001 ms. (steps per millisecond=571 ) properties seen :0 out of 1
Probabilistic random walk after 1714753 steps, saw 739687 distinct states, run finished after 3001 ms. (steps per millisecond=571 ) properties seen :0
[2024-05-28 22:05:12] [INFO ] Invariant cache hit.
[2024-05-28 22:05:12] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/82 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/200 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 43/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 43/243 variables, 26/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 17/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/243 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 172 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/82 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/200 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 43/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 43/243 variables, 26/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 17/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/243 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 374ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 135/135 transitions.
Graph (complete) has 316 edges and 108 vertex of which 107 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 107 transition count 133
Applied a total of 3 rules in 5 ms. Remains 107 /108 variables (removed 1) and now considering 133/135 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 107/108 places, 133/135 transitions.
RANDOM walk for 40000 steps (8916 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1876 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1861539 steps, run timeout after 3001 ms. (steps per millisecond=620 ) properties seen :0 out of 1
Probabilistic random walk after 1861539 steps, saw 801810 distinct states, run finished after 3001 ms. (steps per millisecond=620 ) properties seen :0
// Phase 1: matrix 133 rows 107 cols
[2024-05-28 22:05:15] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 22:05:15] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/182 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 41/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/240 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 17/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/182 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 41/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/240 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 17/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/240 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 364ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 133/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 107/107 places, 133/133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 133/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-28 22:05:16] [INFO ] Invariant cache hit.
[2024-05-28 22:05:16] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 22:05:16] [INFO ] Invariant cache hit.
[2024-05-28 22:05:16] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 22:05:16] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-05-28 22:05:16] [INFO ] Redundant transitions in 0 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-28 22:05:16] [INFO ] Invariant cache hit.
[2024-05-28 22:05:16] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/240 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 58/168 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-28 22:05:21] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 3 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 7 (OVERLAPS) 0/240 variables, 1/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/240 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 169 constraints, problems are : Problem set: 3 solved, 129 unsolved in 9065 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 4/107 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 133/240 variables, 107/111 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 58/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 129/298 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 298 constraints, problems are : Problem set: 3 solved, 129 unsolved in 11832 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 129/132 constraints, Known Traps: 1/1 constraints]
After SMT, in 21060ms problems are : Problem set: 3 solved, 129 unsolved
Search for dead transitions found 3 dead transitions in 21062ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 107/107 places, 130/133 transitions.
Graph (complete) has 307 edges and 107 vertex of which 104 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 104 /107 variables (removed 3) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 104 cols
[2024-05-28 22:05:37] [INFO ] Computed 2 invariants in 2 ms
[2024-05-28 22:05:37] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 22:05:37] [INFO ] Invariant cache hit.
[2024-05-28 22:05:37] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 22:05:38] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 104/107 places, 130/133 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 21958 ms. Remains : 104/107 places, 130/133 transitions.
RANDOM walk for 40000 steps (8948 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1862 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1619801 steps, run timeout after 3001 ms. (steps per millisecond=539 ) properties seen :0 out of 1
Probabilistic random walk after 1619801 steps, saw 698971 distinct states, run finished after 3001 ms. (steps per millisecond=539 ) properties seen :0
[2024-05-28 22:05:41] [INFO ] Invariant cache hit.
[2024-05-28 22:05:41] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 139/228 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/232 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/234 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 139/228 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/232 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/234 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:05:41] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/234 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 473ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 95 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 104/104 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-28 22:05:41] [INFO ] Invariant cache hit.
[2024-05-28 22:05:41] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-28 22:05:41] [INFO ] Invariant cache hit.
[2024-05-28 22:05:42] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 22:05:42] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-05-28 22:05:42] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-28 22:05:42] [INFO ] Invariant cache hit.
[2024-05-28 22:05:42] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/234 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 163 constraints, problems are : Problem set: 0 solved, 129 unsolved in 4722 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/234 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 129/292 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-28 22:05:50] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 293 constraints, problems are : Problem set: 0 solved, 129 unsolved in 11709 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
After SMT, in 16674ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 16676ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17187 ms. Remains : 104/104 places, 130/130 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 123
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 123
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 13 place count 98 transition count 107
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 45 place count 82 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 57 place count 76 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 75 transition count 110
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 75 transition count 110
Applied a total of 61 rules in 16 ms. Remains 75 /104 variables (removed 29) and now considering 110/130 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 110 rows 75 cols
[2024-05-28 22:05:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 22:05:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 22:05:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 22:05:59] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:05:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 22:05:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-28 22:05:59] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 22:05:59] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 22:05:59] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 291 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 135/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 108 cols
[2024-05-28 22:05:59] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:05:59] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-28 22:05:59] [INFO ] Invariant cache hit.
[2024-05-28 22:05:59] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 22:06:00] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-28 22:06:00] [INFO ] Invariant cache hit.
[2024-05-28 22:06:00] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/243 variables, 108/112 constraints. Problems are: Problem set: 0 solved, 134 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 60/172 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-28 22:06:03] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD116 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/243 variables, 1/173 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/243 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 173 constraints, problems are : Problem set: 3 solved, 131 unsolved in 6353 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 4/108 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 135/243 variables, 108/113 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 60/173 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 131/304 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 304 constraints, problems are : Problem set: 3 solved, 131 unsolved in 9149 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 131/134 constraints, Known Traps: 1/1 constraints]
After SMT, in 15690ms problems are : Problem set: 3 solved, 131 unsolved
Search for dead transitions found 3 dead transitions in 15692ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 108/108 places, 132/135 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 105 transition count 132
Applied a total of 3 rules in 2 ms. Remains 105 /108 variables (removed 3) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 105 cols
[2024-05-28 22:06:15] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 22:06:15] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 22:06:15] [INFO ] Invariant cache hit.
[2024-05-28 22:06:16] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 22:06:16] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/108 places, 132/135 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16584 ms. Remains : 105/108 places, 132/135 transitions.
Computed a total of 20 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9001 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1901 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1803543 steps, run timeout after 3001 ms. (steps per millisecond=600 ) properties seen :0 out of 1
Probabilistic random walk after 1803543 steps, saw 777535 distinct states, run finished after 3001 ms. (steps per millisecond=600 ) properties seen :0
[2024-05-28 22:06:19] [INFO ] Invariant cache hit.
[2024-05-28 22:06:19] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/74 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/237 variables, 31/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 17/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/74 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/237 variables, 31/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 17/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/237 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 458ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 132/132 transitions.
Graph (complete) has 307 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 104 transition count 130
Applied a total of 3 rules in 5 ms. Remains 104 /105 variables (removed 1) and now considering 130/132 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 104/105 places, 130/132 transitions.
RANDOM walk for 40000 steps (8987 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1917 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1854380 steps, run timeout after 3001 ms. (steps per millisecond=617 ) properties seen :0 out of 1
Probabilistic random walk after 1854380 steps, saw 798825 distinct states, run finished after 3001 ms. (steps per millisecond=617 ) properties seen :0
// Phase 1: matrix 130 rows 104 cols
[2024-05-28 22:06:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 22:06:23] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 139/228 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/232 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/234 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 139/228 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/232 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/234 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:06:23] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/234 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 544ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 104/104 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-28 22:06:23] [INFO ] Invariant cache hit.
[2024-05-28 22:06:23] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 22:06:23] [INFO ] Invariant cache hit.
[2024-05-28 22:06:23] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 22:06:24] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-28 22:06:24] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-28 22:06:24] [INFO ] Invariant cache hit.
[2024-05-28 22:06:24] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/234 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 163 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5224 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/234 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 129/292 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-28 22:06:32] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 293 constraints, problems are : Problem set: 0 solved, 129 unsolved in 11241 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
After SMT, in 16610ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 16612ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16973 ms. Remains : 104/104 places, 130/130 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 123
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 123
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 13 place count 98 transition count 107
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 45 place count 82 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 57 place count 76 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 75 transition count 110
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 75 transition count 110
Applied a total of 61 rules in 12 ms. Remains 75 /104 variables (removed 29) and now considering 110/130 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 110 rows 75 cols
[2024-05-28 22:06:40] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 22:06:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 22:06:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 22:06:40] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:06:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 22:06:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 22:06:41] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 22:06:41] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 22:06:41] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 478 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22633 reset in 324 ms.
Product exploration explored 100000 steps with 22554 reset in 300 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 132/132 transitions.
Applied a total of 0 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-28 22:06:42] [INFO ] Redundant transitions in 0 ms returned []
Running 131 sub problems to find dead transitions.
// Phase 1: matrix 132 rows 105 cols
[2024-05-28 22:06:42] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 22:06:42] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/237 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 167 constraints, problems are : Problem set: 0 solved, 131 unsolved in 4719 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/237 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 59/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 131/298 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 22:06:51] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 299 constraints, problems are : Problem set: 0 solved, 131 unsolved in 14946 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 1/1 constraints]
After SMT, in 19911ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 19914ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19944 ms. Remains : 105/105 places, 132/132 transitions.
Built C files in :
/tmp/ltsmin8309584673466646880
[2024-05-28 22:07:02] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8309584673466646880
Running compilation step : cd /tmp/ltsmin8309584673466646880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 407 ms.
Running link step : cd /tmp/ltsmin8309584673466646880;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8309584673466646880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17500938183265399895.hoa' '--buchi-type=spotba'
LTSmin run took 455 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-05 finished in 140853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G(p1))))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 394/394 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 217
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 149 transition count 216
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 132 transition count 198
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 132 transition count 198
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 132 transition count 192
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 119 transition count 170
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 119 transition count 170
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 110 place count 119 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 116 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 116 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 113 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 113 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 112 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 112 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 111 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 110 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 110 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 109 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 109 transition count 149
Applied a total of 130 rules in 22 ms. Remains 109 /166 variables (removed 57) and now considering 149/394 (removed 245) transitions.
// Phase 1: matrix 149 rows 109 cols
[2024-05-28 22:07:03] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:07:03] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-28 22:07:03] [INFO ] Invariant cache hit.
[2024-05-28 22:07:03] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 22:07:04] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2024-05-28 22:07:04] [INFO ] Invariant cache hit.
[2024-05-28 22:07:04] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-28 22:07:06] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 6 (OVERLAPS) 149/258 variables, 109/114 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 74/188 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/188 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/188 constraints. Problems are: Problem set: 3 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 188 constraints, problems are : Problem set: 3 solved, 145 unsolved in 7269 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 2/108 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 149/257 variables, 108/113 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 74/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 18/205 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/205 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 1/258 variables, 1/206 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 127/333 constraints. Problems are: Problem set: 3 solved, 145 unsolved
[2024-05-28 22:07:18] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/334 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/334 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/334 constraints. Problems are: Problem set: 3 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 334 constraints, problems are : Problem set: 3 solved, 145 unsolved in 17802 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 145/148 constraints, Known Traps: 2/2 constraints]
After SMT, in 25235ms problems are : Problem set: 3 solved, 145 unsolved
Search for dead transitions found 3 dead transitions in 25237ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 109/166 places, 146/394 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 106 transition count 146
Applied a total of 3 rules in 2 ms. Remains 106 /109 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-28 22:07:29] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:07:29] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-28 22:07:29] [INFO ] Invariant cache hit.
[2024-05-28 22:07:29] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 22:07:30] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/166 places, 146/394 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26402 ms. Remains : 106/166 places, 146/394 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-07 finished in 26585 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 (X(p1) U (p1||F(p2)))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 394/394 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 150 transition count 230
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 150 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 150 transition count 229
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 134 transition count 212
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 134 transition count 212
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 134 transition count 206
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 83 place count 122 transition count 186
Iterating global reduction 2 with 12 rules applied. Total rules applied 95 place count 122 transition count 186
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 103 place count 122 transition count 178
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 120 transition count 176
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 120 transition count 176
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 118 transition count 174
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 118 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 117 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 117 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 116 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 116 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 115 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 115 transition count 169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 114 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 114 transition count 168
Applied a total of 119 rules in 22 ms. Remains 114 /166 variables (removed 52) and now considering 168/394 (removed 226) transitions.
// Phase 1: matrix 168 rows 114 cols
[2024-05-28 22:07:30] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:07:30] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 22:07:30] [INFO ] Invariant cache hit.
[2024-05-28 22:07:30] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-28 22:07:30] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-28 22:07:30] [INFO ] Invariant cache hit.
[2024-05-28 22:07:30] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 5 (OVERLAPS) 168/282 variables, 114/118 constraints. Problems are: Problem set: 3 solved, 164 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 89/207 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 207 constraints, problems are : Problem set: 3 solved, 164 unsolved in 6358 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 2/113 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 164 unsolved
[2024-05-28 22:07:38] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 168/281 variables, 113/118 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 89/207 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 19/226 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/226 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 1/282 variables, 1/227 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 145/372 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 0/372 constraints. Problems are: Problem set: 3 solved, 164 unsolved
At refinement iteration 15 (OVERLAPS) 0/282 variables, 0/372 constraints. Problems are: Problem set: 3 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 372 constraints, problems are : Problem set: 3 solved, 164 unsolved in 23454 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 164/167 constraints, Known Traps: 1/1 constraints]
After SMT, in 30026ms problems are : Problem set: 3 solved, 164 unsolved
Search for dead transitions found 3 dead transitions in 30028ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 114/166 places, 165/394 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 165
Applied a total of 3 rules in 3 ms. Remains 111 /114 variables (removed 3) and now considering 165/165 (removed 0) transitions.
// Phase 1: matrix 165 rows 111 cols
[2024-05-28 22:08:00] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:08:00] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 22:08:00] [INFO ] Invariant cache hit.
[2024-05-28 22:08:00] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-28 22:08:01] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/166 places, 165/394 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31046 ms. Remains : 111/166 places, 165/394 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-09 finished in 31263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||X(F(p0)))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 394/394 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 207
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 149 transition count 205
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 53 place count 132 transition count 187
Iterating global reduction 1 with 17 rules applied. Total rules applied 70 place count 132 transition count 187
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 76 place count 132 transition count 181
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 119 transition count 158
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 119 transition count 158
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 111 place count 119 transition count 149
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 115 transition count 145
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 115 transition count 145
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 112 transition count 142
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 112 transition count 142
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 111 transition count 141
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 111 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 111 transition count 139
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 110 transition count 138
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 110 transition count 138
Applied a total of 131 rules in 27 ms. Remains 110 /166 variables (removed 56) and now considering 138/394 (removed 256) transitions.
// Phase 1: matrix 138 rows 110 cols
[2024-05-28 22:08:01] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 22:08:01] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 22:08:01] [INFO ] Invariant cache hit.
[2024-05-28 22:08:01] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 22:08:01] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2024-05-28 22:08:01] [INFO ] Invariant cache hit.
[2024-05-28 22:08:01] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-28 22:08:03] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 6 (OVERLAPS) 138/248 variables, 110/115 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 61/176 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 134 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/248 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 176 constraints, problems are : Problem set: 3 solved, 134 unsolved in 6141 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 2/109 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 138/247 variables, 109/114 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 61/175 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 18/193 constraints. Problems are: Problem set: 3 solved, 134 unsolved
[2024-05-28 22:08:10] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 1/194 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 13 (OVERLAPS) 1/248 variables, 1/195 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 116/311 constraints. Problems are: Problem set: 3 solved, 134 unsolved
[2024-05-28 22:08:15] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 1/312 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/248 variables, 0/312 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 17 (OVERLAPS) 0/248 variables, 0/312 constraints. Problems are: Problem set: 3 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 312 constraints, problems are : Problem set: 3 solved, 134 unsolved in 17404 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 134/137 constraints, Known Traps: 3/3 constraints]
After SMT, in 23698ms problems are : Problem set: 3 solved, 134 unsolved
Search for dead transitions found 3 dead transitions in 23700ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/166 places, 135/394 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 135
Applied a total of 3 rules in 1 ms. Remains 107 /110 variables (removed 3) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 107 cols
[2024-05-28 22:08:25] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 22:08:25] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 22:08:25] [INFO ] Invariant cache hit.
[2024-05-28 22:08:25] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 22:08:26] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/166 places, 135/394 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24576 ms. Remains : 107/166 places, 135/394 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-11 finished in 24709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 394/394 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 206
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 149 transition count 205
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 132 transition count 187
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 132 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 76 place count 132 transition count 180
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 119 transition count 157
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 119 transition count 157
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 111 place count 119 transition count 148
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 116 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 116 transition count 145
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 113 transition count 142
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 113 transition count 142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 111 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 111 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 111 transition count 138
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 110 transition count 137
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 110 transition count 137
Applied a total of 131 rules in 22 ms. Remains 110 /166 variables (removed 56) and now considering 137/394 (removed 257) transitions.
// Phase 1: matrix 137 rows 110 cols
[2024-05-28 22:08:26] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:08:26] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 22:08:26] [INFO ] Invariant cache hit.
[2024-05-28 22:08:26] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 22:08:26] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-28 22:08:26] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-28 22:08:26] [INFO ] Invariant cache hit.
[2024-05-28 22:08:26] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 5 (OVERLAPS) 137/247 variables, 110/114 constraints. Problems are: Problem set: 3 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 61/175 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/247 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 175 constraints, problems are : Problem set: 3 solved, 133 unsolved in 4406 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 2/109 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 137/246 variables, 109/113 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 61/174 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 18/192 constraints. Problems are: Problem set: 3 solved, 133 unsolved
[2024-05-28 22:08:33] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/193 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 12 (OVERLAPS) 1/247 variables, 1/194 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 115/309 constraints. Problems are: Problem set: 3 solved, 133 unsolved
[2024-05-28 22:08:39] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 1/310 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 16 (OVERLAPS) 0/247 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 310 constraints, problems are : Problem set: 3 solved, 133 unsolved in 18311 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 133/136 constraints, Known Traps: 2/2 constraints]
After SMT, in 22866ms problems are : Problem set: 3 solved, 133 unsolved
Search for dead transitions found 3 dead transitions in 22867ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 110/166 places, 134/394 transitions.
Graph (complete) has 352 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 107 /110 variables (removed 3) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 107 cols
[2024-05-28 22:08:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:08:49] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 22:08:49] [INFO ] Invariant cache hit.
[2024-05-28 22:08:49] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 22:08:49] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/166 places, 134/394 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23728 ms. Remains : 107/166 places, 134/394 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-12
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-12 finished in 23781 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(((p1 U G(p2))&&p0)))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 394/394 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 217
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 149 transition count 216
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 52 place count 132 transition count 198
Iterating global reduction 1 with 17 rules applied. Total rules applied 69 place count 132 transition count 198
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 76 place count 132 transition count 191
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 119 transition count 169
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 119 transition count 169
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 111 place count 119 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 116 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 116 transition count 157
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 113 transition count 154
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 113 transition count 154
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 111 transition count 152
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 111 transition count 152
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 130 place count 111 transition count 149
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 132 place count 109 transition count 145
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 109 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 108 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 108 transition count 144
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 107 transition count 143
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 107 transition count 143
Applied a total of 138 rules in 16 ms. Remains 107 /166 variables (removed 59) and now considering 143/394 (removed 251) transitions.
// Phase 1: matrix 143 rows 107 cols
[2024-05-28 22:08:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:08:50] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 22:08:50] [INFO ] Invariant cache hit.
[2024-05-28 22:08:50] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-28 22:08:50] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-28 22:08:50] [INFO ] Invariant cache hit.
[2024-05-28 22:08:50] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 5 (OVERLAPS) 143/250 variables, 107/111 constraints. Problems are: Problem set: 3 solved, 139 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 70/181 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 0/250 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 181 constraints, problems are : Problem set: 3 solved, 139 unsolved in 4973 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 143/249 variables, 106/110 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 70/180 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 18/198 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 11 (OVERLAPS) 1/250 variables, 1/199 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 121/320 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/320 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 14 (OVERLAPS) 0/250 variables, 0/320 constraints. Problems are: Problem set: 3 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 320 constraints, problems are : Problem set: 3 solved, 139 unsolved in 16347 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 139/142 constraints, Known Traps: 0/0 constraints]
After SMT, in 21477ms problems are : Problem set: 3 solved, 139 unsolved
Search for dead transitions found 3 dead transitions in 21478ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 107/166 places, 140/394 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 104 transition count 140
Applied a total of 3 rules in 1 ms. Remains 104 /107 variables (removed 3) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 104 cols
[2024-05-28 22:09:11] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 22:09:12] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 22:09:12] [INFO ] Invariant cache hit.
[2024-05-28 22:09:12] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 22:09:12] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/166 places, 140/394 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22406 ms. Remains : 104/166 places, 140/394 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-14 finished in 22588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0&&X((!p0 U (!p1||G(!p0))))))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 394/394 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 148 transition count 204
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 148 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 148 transition count 203
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 55 place count 130 transition count 184
Iterating global reduction 1 with 18 rules applied. Total rules applied 73 place count 130 transition count 184
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 79 place count 130 transition count 178
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 93 place count 116 transition count 154
Iterating global reduction 2 with 14 rules applied. Total rules applied 107 place count 116 transition count 154
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 117 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 112 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 112 transition count 140
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 108 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 108 transition count 136
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 106 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 106 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 139 place count 106 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 141 place count 104 transition count 128
Iterating global reduction 4 with 2 rules applied. Total rules applied 143 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 144 place count 103 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 102 transition count 126
Applied a total of 147 rules in 14 ms. Remains 102 /166 variables (removed 64) and now considering 126/394 (removed 268) transitions.
// Phase 1: matrix 126 rows 102 cols
[2024-05-28 22:09:12] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 22:09:12] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 22:09:12] [INFO ] Invariant cache hit.
[2024-05-28 22:09:12] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 22:09:12] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-28 22:09:12] [INFO ] Invariant cache hit.
[2024-05-28 22:09:12] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 5 (OVERLAPS) 126/228 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 162 constraints, problems are : Problem set: 3 solved, 122 unsolved in 3584 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 126/227 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 56/161 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 17/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 1/228 variables, 1/179 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 105/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 284 constraints, problems are : Problem set: 3 solved, 122 unsolved in 9604 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 122/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 13320ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 13323ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 102/166 places, 123/394 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 99 transition count 123
Applied a total of 3 rules in 1 ms. Remains 99 /102 variables (removed 3) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-05-28 22:09:26] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 22:09:26] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-28 22:09:26] [INFO ] Invariant cache hit.
[2024-05-28 22:09:26] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 22:09:26] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/166 places, 123/394 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14127 ms. Remains : 99/166 places, 123/394 transitions.
Stuttering acceptance computed with spot in 102 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 236 ms.
Product exploration explored 100000 steps with 33333 reset in 274 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 94 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 finished in 14852 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 U (p1||G(!p0))) U ((G(!p2)&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0))))))||p3)))'
[2024-05-28 22:09:27] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4602937893180696861
[2024-05-28 22:09:27] [INFO ] Computing symmetric may disable matrix : 394 transitions.
[2024-05-28 22:09:27] [INFO ] Applying decomposition
[2024-05-28 22:09:27] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:09:27] [INFO ] Computing symmetric may enable matrix : 394 transitions.
[2024-05-28 22:09:27] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:09:27] [INFO ] Flatten gal took : 25 ms
[2024-05-28 22:09:27] [INFO ] Computing Do-Not-Accords matrix : 394 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15171810773078040350.txt' '-o' '/tmp/graph15171810773078040350.bin' '-w' '/tmp/graph15171810773078040350.weights'
[2024-05-28 22:09:27] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15171810773078040350.bin' '-l' '-1' '-v' '-w' '/tmp/graph15171810773078040350.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:09:27] [INFO ] Decomposing Gal with order
[2024-05-28 22:09:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:09:27] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4602937893180696861
Running compilation step : cd /tmp/ltsmin4602937893180696861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 22:09:27] [INFO ] Removed a total of 187 redundant transitions.
[2024-05-28 22:09:27] [INFO ] Flatten gal took : 54 ms
[2024-05-28 22:09:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 210 labels/synchronizations in 13 ms.
[2024-05-28 22:09:27] [INFO ] Time to serialize gal into /tmp/LTLFireability7771316884513915300.gal : 8 ms
[2024-05-28 22:09:27] [INFO ] Time to serialize properties into /tmp/LTLFireability13983041107195888717.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7771316884513915300.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13983041107195888717.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((((!("(((u0.s1>=1)&&(u0.l2237>=1))&&((u0.s1>=1)&&(u3.l1699>=1)))"))U(("((!(((u0.s1>=1)&&(u0.l2237>=1))||((u0.s1>=1)&&(u0.l2220>=1...923
Formula 0 simplified : G(!"((u0.s1>=1)&&(u0.l2220>=1))" & (("(((u0.s1>=1)&&(u0.l2237>=1))&&((u0.s1>=1)&&(u3.l1699>=1)))" M !"((!(((u0.s1>=1)&&(u0.l2237>=1)...687
Compilation finished in 1926 ms.
Running link step : cd /tmp/ltsmin4602937893180696861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4602937893180696861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))) U (([](!(LTLAPp2==true))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||[]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))))||(LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 22:33:52] [INFO ] Flatten gal took : 61 ms
[2024-05-28 22:33:52] [INFO ] Time to serialize gal into /tmp/LTLFireability5959093141959290796.gal : 5 ms
[2024-05-28 22:33:52] [INFO ] Time to serialize properties into /tmp/LTLFireability9993296377787054462.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5959093141959290796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9993296377787054462.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F((((!("(((s1>=1)&&(l2237>=1))&&((s1>=1)&&(l1699>=1)))"))U(("((!(((s1>=1)&&(l2237>=1))||((s1>=1)&&(l2220>=1))))&&(!(((s1>=1)&&(l223...767
Formula 0 simplified : G(!"((s1>=1)&&(l2220>=1))" & (("(((s1>=1)&&(l2237>=1))&&((s1>=1)&&(l1699>=1)))" M !"((!(((s1>=1)&&(l2237>=1))||((s1>=1)&&(l2220>=1))...567

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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