Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K 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 102K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 19:29 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-d2m06-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717247399957

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:10:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:10:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:10:02] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2024-06-01 13:10:02] [INFO ] Transformed 2398 places.
[2024-06-01 13:10:02] [INFO ] Transformed 1954 transitions.
[2024-06-01 13:10:02] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 555 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1984 places in 24 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 950 place count 292 transition count 689
Iterating global reduction 1 with 97 rules applied. Total rules applied 1047 place count 292 transition count 689
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1058 place count 292 transition count 678
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 1125 place count 225 transition count 611
Iterating global reduction 2 with 67 rules applied. Total rules applied 1192 place count 225 transition count 611
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 1232 place count 225 transition count 571
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1254 place count 203 transition count 546
Iterating global reduction 3 with 22 rules applied. Total rules applied 1276 place count 203 transition count 546
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 1337 place count 203 transition count 485
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1342 place count 198 transition count 477
Iterating global reduction 4 with 5 rules applied. Total rules applied 1347 place count 198 transition count 477
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1352 place count 193 transition count 472
Iterating global reduction 4 with 5 rules applied. Total rules applied 1357 place count 193 transition count 472
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1359 place count 191 transition count 469
Iterating global reduction 4 with 2 rules applied. Total rules applied 1361 place count 191 transition count 469
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1362 place count 190 transition count 468
Iterating global reduction 4 with 1 rules applied. Total rules applied 1363 place count 190 transition count 468
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1364 place count 189 transition count 467
Iterating global reduction 4 with 1 rules applied. Total rules applied 1365 place count 189 transition count 467
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1366 place count 188 transition count 466
Iterating global reduction 4 with 1 rules applied. Total rules applied 1367 place count 188 transition count 466
Applied a total of 1367 rules in 253 ms. Remains 188 /414 variables (removed 226) and now considering 466/1954 (removed 1488) transitions.
// Phase 1: matrix 466 rows 188 cols
[2024-06-01 13:10:03] [INFO ] Computed 5 invariants in 58 ms
[2024-06-01 13:10:04] [INFO ] Implicit Places using invariants in 647 ms returned []
[2024-06-01 13:10:04] [INFO ] Invariant cache hit.
[2024-06-01 13:10:04] [INFO ] State equation strengthened by 320 read => feed constraints.
[2024-06-01 13:10:05] [INFO ] Implicit Places using invariants and state equation in 1155 ms returned []
Implicit Place search using SMT with State Equation took 1866 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2024-06-01 13:10:05] [INFO ] Invariant cache hit.
[2024-06-01 13:10:05] [INFO ] State equation strengthened by 320 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-06-01 13:10:13] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-06-01 13:10:16] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 4 ms to minimize.
[2024-06-01 13:10:16] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 5 (OVERLAPS) 1/188 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-06-01 13:10:24] [INFO ] Deduced a trap composed of 60 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:10:24] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:10:24] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 3 ms to minimize.
[2024-06-01 13:10:24] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 3 ms to minimize.
[2024-06-01 13:10:24] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 3 ms to minimize.
[2024-06-01 13:10:25] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:10:25] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 3 ms to minimize.
[2024-06-01 13:10:25] [INFO ] Deduced a trap composed of 62 places in 138 ms of which 4 ms to minimize.
[2024-06-01 13:10:25] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 3 ms to minimize.
[2024-06-01 13:10:25] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 8 (OVERLAPS) 466/654 variables, 188/206 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 320/526 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 654/654 variables, and 526 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 188/188 constraints, ReadFeed: 320/320 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 5 (OVERLAPS) 1/188 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 8 (OVERLAPS) 466/654 variables, 188/207 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 320/527 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/654 variables, 465/992 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/654 variables, and 992 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 188/188 constraints, ReadFeed: 320/320 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 14/14 constraints]
After SMT, in 62156ms problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 62195ms
Starting structural reductions in LTL mode, iteration 1 : 188/414 places, 466/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64364 ms. Remains : 188/414 places, 466/1954 transitions.
Support contains 33 out of 188 places after structural reductions.
[2024-06-01 13:11:08] [INFO ] Flatten gal took : 95 ms
[2024-06-01 13:11:08] [INFO ] Flatten gal took : 52 ms
[2024-06-01 13:11:08] [INFO ] Input system was already deterministic with 466 transitions.
Support contains 31 out of 188 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (9010 resets) in 4548 ms. (8 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (183 resets) in 62 ms. (63 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (186 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (188 resets) in 77 ms. (51 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (178 resets) in 46 ms. (85 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (188 resets) in 44 ms. (88 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (182 resets) in 61 ms. (64 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (196 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (190 resets) in 40 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (197 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (192 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (178 resets) in 44 ms. (88 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (428 resets) in 93 ms. (42 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (192 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (180 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (208 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (183 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (202 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (189 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (197 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (175 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (193 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (174 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (197 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (196 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (170 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (204 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 291770 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :22 out of 26
Probabilistic random walk after 291770 steps, saw 118409 distinct states, run finished after 3019 ms. (steps per millisecond=96 ) properties seen :22
[2024-06-01 13:11:13] [INFO ] Invariant cache hit.
[2024-06-01 13:11:13] [INFO ] State equation strengthened by 320 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 82/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 5 (OVERLAPS) 45/149 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 250/399 variables, 149/154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 104/258 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 10 (OVERLAPS) 255/654 variables, 39/297 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/654 variables, 216/513 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/654 variables, 0/513 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/654 variables, 0/513 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 654/654 variables, and 513 constraints, problems are : Problem set: 2 solved, 2 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 188/188 constraints, ReadFeed: 320/320 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/85 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/99 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 46/145 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 208/353 variables, 145/150 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 62/212 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/212 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 301/654 variables, 43/255 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/654 variables, 258/513 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/654 variables, 2/515 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 13:11:14] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/654 variables, 1/516 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/654 variables, 0/516 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/654 variables, 0/516 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 654/654 variables, and 516 constraints, problems are : Problem set: 2 solved, 2 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 188/188 constraints, ReadFeed: 320/320 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1774ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 210 ms.
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 466/466 transitions.
Graph (complete) has 763 edges and 188 vertex of which 187 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 187 transition count 464
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 29 place count 161 transition count 213
Iterating global reduction 1 with 26 rules applied. Total rules applied 55 place count 161 transition count 213
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 161 transition count 208
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 82 place count 139 transition count 184
Iterating global reduction 2 with 22 rules applied. Total rules applied 104 place count 139 transition count 184
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 139 transition count 176
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 127 place count 124 transition count 151
Iterating global reduction 3 with 15 rules applied. Total rules applied 142 place count 124 transition count 151
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 153 place count 124 transition count 140
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 158 place count 119 transition count 135
Iterating global reduction 4 with 5 rules applied. Total rules applied 163 place count 119 transition count 135
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 167 place count 115 transition count 131
Iterating global reduction 4 with 4 rules applied. Total rules applied 171 place count 115 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 174 place count 112 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 177 place count 112 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 179 place count 112 transition count 126
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 181 place count 110 transition count 124
Iterating global reduction 5 with 2 rules applied. Total rules applied 183 place count 110 transition count 124
Applied a total of 183 rules in 62 ms. Remains 110 /188 variables (removed 78) and now considering 124/466 (removed 342) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 110/188 places, 124/466 transitions.
RANDOM walk for 40000 steps (8947 resets) in 272 ms. (146 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1863 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1888 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Probably explored full state space saw : 75554 states, properties seen :0
Probabilistic random walk after 183050 steps, saw 75554 distinct states, run finished after 1429 ms. (steps per millisecond=128 ) properties seen :0
Explored full state space saw : 75554 states, properties seen :0
Exhaustive walk after 183050 steps, saw 75554 distinct states, run finished after 1127 ms. (steps per millisecond=162 ) properties seen :0
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 42 stabilizing places and 72 stable transitions
Graph (complete) has 829 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((p0||X(F(!p1))))) U p2)))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 163 transition count 239
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 163 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 163 transition count 235
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 75 place count 142 transition count 212
Iterating global reduction 1 with 21 rules applied. Total rules applied 96 place count 142 transition count 212
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 103 place count 142 transition count 205
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 117 place count 128 transition count 183
Iterating global reduction 2 with 14 rules applied. Total rules applied 131 place count 128 transition count 183
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 141 place count 128 transition count 173
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 124 transition count 169
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 124 transition count 169
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 120 transition count 165
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 120 transition count 165
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 117 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 117 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 166 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 168 place count 115 transition count 155
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 115 transition count 155
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 171 place count 114 transition count 154
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 173 place count 113 transition count 153
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 113 transition count 153
Applied a total of 174 rules in 94 ms. Remains 113 /188 variables (removed 75) and now considering 153/466 (removed 313) transitions.
// Phase 1: matrix 153 rows 113 cols
[2024-06-01 13:11:18] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 13:11:18] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 13:11:18] [INFO ] Invariant cache hit.
[2024-06-01 13:11:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:11:18] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2024-06-01 13:11:18] [INFO ] Redundant transitions in 9 ms returned []
Running 152 sub problems to find dead transitions.
[2024-06-01 13:11:19] [INFO ] Invariant cache hit.
[2024-06-01 13:11:19] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 13:11:21] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:11:21] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 13:11:22] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 1/113 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 13:11:24] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:11:24] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:11:24] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:11:24] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 153/266 variables, 113/125 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 75/200 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 0/266 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 200 constraints, problems are : Problem set: 0 solved, 152 unsolved in 10801 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 1/113 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 153/266 variables, 113/125 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 75/200 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 152/352 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 13:11:35] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD138 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 1/353 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 0/353 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 12 (OVERLAPS) 0/266 variables, 0/353 constraints. Problems are: Problem set: 3 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 353 constraints, problems are : Problem set: 3 solved, 149 unsolved in 22390 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 8/8 constraints]
After SMT, in 33458ms problems are : Problem set: 3 solved, 149 unsolved
Search for dead transitions found 3 dead transitions in 33463ms
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 : 113/188 places, 150/466 transitions.
Graph (complete) has 374 edges and 113 vertex of which 110 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 13 ms. Remains 110 /113 variables (removed 3) and now considering 150/150 (removed 0) transitions.
// Phase 1: matrix 150 rows 110 cols
[2024-06-01 13:11:52] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 13:11:52] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 13:11:52] [INFO ] Invariant cache hit.
[2024-06-01 13:11:52] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-01 13:11:52] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/188 places, 150/466 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 34642 ms. Remains : 110/188 places, 150/466 transitions.
Stuttering acceptance computed with spot in 407 ms :[(NOT p2), (AND (NOT p0) p1), (NOT p2), (AND (NOT p0) p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-00
Stuttering criterion allowed to conclude after 21 steps with 6 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-00 finished in 35155 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(G(p0)) U p1)))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 162 transition count 238
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 162 transition count 238
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 162 transition count 234
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 78 place count 140 transition count 210
Iterating global reduction 1 with 22 rules applied. Total rules applied 100 place count 140 transition count 210
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 106 place count 140 transition count 204
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 121 place count 125 transition count 181
Iterating global reduction 2 with 15 rules applied. Total rules applied 136 place count 125 transition count 181
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 149 place count 125 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 121 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 121 transition count 164
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 161 place count 117 transition count 160
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 117 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 167 place count 115 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 115 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 170 place count 114 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 171 place count 114 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 172 place count 113 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 173 place count 113 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 112 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 112 transition count 153
Applied a total of 175 rules in 24 ms. Remains 112 /188 variables (removed 76) and now considering 153/466 (removed 313) transitions.
// Phase 1: matrix 153 rows 112 cols
[2024-06-01 13:11:53] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 13:11:53] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 13:11:53] [INFO ] Invariant cache hit.
[2024-06-01 13:11:53] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:11:54] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-06-01 13:11:54] [INFO ] Invariant cache hit.
[2024-06-01 13:11:54] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 13:11:56] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-06-01 13:11:56] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
[2024-06-01 13:11:56] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:11:56] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/265 variables, 112/121 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 75/196 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 13:11:59] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 1/197 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 197 constraints, problems are : Problem set: 3 solved, 149 unsolved in 10953 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 3 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 4/112 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 149 unsolved
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 2/12 constraints. Problems are: Problem set: 3 solved, 149 unsolved
[2024-06-01 13:12:07] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/13 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 9 (OVERLAPS) 153/265 variables, 112/125 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 75/200 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 149/349 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/349 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/349 constraints. Problems are: Problem set: 3 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 349 constraints, problems are : Problem set: 3 solved, 149 unsolved in 18482 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 149/152 constraints, Known Traps: 8/8 constraints]
After SMT, in 29718ms problems are : Problem set: 3 solved, 149 unsolved
Search for dead transitions found 3 dead transitions in 29721ms
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 : 112/188 places, 150/466 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 109 transition count 150
Applied a total of 3 rules in 3 ms. Remains 109 /112 variables (removed 3) and now considering 150/150 (removed 0) transitions.
// Phase 1: matrix 150 rows 109 cols
[2024-06-01 13:12:23] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:12:23] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 13:12:23] [INFO ] Invariant cache hit.
[2024-06-01 13:12:24] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-01 13:12:24] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 109/188 places, 150/466 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31026 ms. Remains : 109/188 places, 150/466 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-01 finished in 31218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p1)&&X(!p1))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 162 transition count 238
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 162 transition count 238
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 162 transition count 234
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 78 place count 140 transition count 210
Iterating global reduction 1 with 22 rules applied. Total rules applied 100 place count 140 transition count 210
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 106 place count 140 transition count 204
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 121 place count 125 transition count 181
Iterating global reduction 2 with 15 rules applied. Total rules applied 136 place count 125 transition count 181
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 149 place count 125 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 121 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 121 transition count 164
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 161 place count 117 transition count 160
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 117 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 167 place count 115 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 115 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 170 place count 114 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 171 place count 114 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 172 place count 113 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 173 place count 113 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 112 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 112 transition count 153
Applied a total of 175 rules in 21 ms. Remains 112 /188 variables (removed 76) and now considering 153/466 (removed 313) transitions.
// Phase 1: matrix 153 rows 112 cols
[2024-06-01 13:12:24] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 13:12:24] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 13:12:24] [INFO ] Invariant cache hit.
[2024-06-01 13:12:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:12:25] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-06-01 13:12:25] [INFO ] Invariant cache hit.
[2024-06-01 13:12:25] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 13:12:26] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:12:26] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 13:12:27] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 1/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 13:12:29] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:12:29] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:12:29] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 13:12:30] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 153/265 variables, 112/124 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 75/199 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 13:12:32] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD139 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 1/200 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/200 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/200 constraints. Problems are: Problem set: 3 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 200 constraints, problems are : Problem set: 3 solved, 149 unsolved in 14872 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 3 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 4/112 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 5/13 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 153/265 variables, 112/125 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 75/200 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 149/349 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/349 constraints. Problems are: Problem set: 3 solved, 149 unsolved
At refinement iteration 11 (OVERLAPS) 0/265 variables, 0/349 constraints. Problems are: Problem set: 3 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 349 constraints, problems are : Problem set: 3 solved, 149 unsolved in 17401 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 149/152 constraints, Known Traps: 8/8 constraints]
After SMT, in 32568ms problems are : Problem set: 3 solved, 149 unsolved
Search for dead transitions found 3 dead transitions in 32571ms
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 : 112/188 places, 150/466 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 109 transition count 150
Applied a total of 3 rules in 3 ms. Remains 109 /112 variables (removed 3) and now considering 150/150 (removed 0) transitions.
// Phase 1: matrix 150 rows 109 cols
[2024-06-01 13:12:57] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:12:57] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 13:12:57] [INFO ] Invariant cache hit.
[2024-06-01 13:12:57] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-01 13:12:58] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 109/188 places, 150/466 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33649 ms. Remains : 109/188 places, 150/466 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-02
Product exploration explored 100000 steps with 22397 reset in 485 ms.
Product exploration explored 100000 steps with 22474 reset in 303 ms.
Computed a total of 19 stabilizing places and 25 stable transitions
Graph (complete) has 369 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 19 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 153 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8972 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1888 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 57855 steps, run visited all 1 properties in 260 ms. (steps per millisecond=222 )
Probabilistic random walk after 57855 steps, saw 24939 distinct states, run finished after 268 ms. (steps per millisecond=215 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 109 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Applied a total of 0 rules in 12 ms. Remains 109 /109 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-06-01 13:13:00] [INFO ] Invariant cache hit.
[2024-06-01 13:13:00] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 13:13:00] [INFO ] Invariant cache hit.
[2024-06-01 13:13:00] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-01 13:13:00] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-06-01 13:13:00] [INFO ] Redundant transitions in 4 ms returned []
Running 149 sub problems to find dead transitions.
[2024-06-01 13:13:00] [INFO ] Invariant cache hit.
[2024-06-01 13:13:00] [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-06-01 13:13:02] [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, 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
[2024-06-01 13:13:06] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:13:06] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 2/190 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/190 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/259 variables, 0/190 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 190 constraints, problems are : Problem set: 3 solved, 146 unsolved in 9567 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: 3/3 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, 2/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/106 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-06-01 13:13:11] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 2/108 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 150/258 variables, 108/116 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 74/190 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 18/208 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/208 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 14 (OVERLAPS) 1/259 variables, 1/209 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 128/337 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/259 variables, 0/337 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 17 (OVERLAPS) 0/259 variables, 0/337 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 337 constraints, problems are : Problem set: 3 solved, 146 unsolved in 21651 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: 4/4 constraints]
After SMT, in 31397ms problems are : Problem set: 3 solved, 146 unsolved
Search for dead transitions found 3 dead transitions in 31399ms
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/109 places, 147/150 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 9 ms. Remains 106 /109 variables (removed 3) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 106 cols
[2024-06-01 13:13:32] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:13:32] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-01 13:13:32] [INFO ] Invariant cache hit.
[2024-06-01 13:13:32] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-01 13:13:32] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/109 places, 147/150 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32439 ms. Remains : 106/109 places, 147/150 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 359 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8950 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1963 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 57855 steps, run visited all 1 properties in 101 ms. (steps per millisecond=572 )
Probabilistic random walk after 57855 steps, saw 24939 distinct states, run finished after 102 ms. (steps per millisecond=567 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22381 reset in 273 ms.
Product exploration explored 100000 steps with 22434 reset in 228 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 147/147 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 104 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 104 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 104 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 103 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 103 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 103 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 102 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 102 transition count 128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 101 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 101 transition count 127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 100 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 100 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 100 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 99 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 99 transition count 123
Applied a total of 18 rules in 37 ms. Remains 99 /106 variables (removed 7) and now considering 123/147 (removed 24) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-06-01 13:13:34] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:13:34] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 13:13:34] [INFO ] Invariant cache hit.
[2024-06-01 13:13:34] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:13:34] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-06-01 13:13:34] [INFO ] Redundant transitions in 5 ms returned []
Running 122 sub problems to find dead transitions.
[2024-06-01 13:13:34] [INFO ] Invariant cache hit.
[2024-06-01 13:13:34] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 13:13:36] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/222 variables, 99/104 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 13:13:39] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/222 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/222 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 160 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8921 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 1/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 13:13:44] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 123/222 variables, 99/106 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 55/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 122/283 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 283 constraints, problems are : Problem set: 0 solved, 122 unsolved in 12203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 3/3 constraints]
After SMT, in 21310ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 21312ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/106 places, 123/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21731 ms. Remains : 99/106 places, 123/147 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-02 finished in 91487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 162 transition count 225
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 162 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 162 transition count 222
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 77 place count 140 transition count 199
Iterating global reduction 1 with 22 rules applied. Total rules applied 99 place count 140 transition count 199
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 107 place count 140 transition count 191
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 122 place count 125 transition count 167
Iterating global reduction 2 with 15 rules applied. Total rules applied 137 place count 125 transition count 167
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 150 place count 125 transition count 154
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 154 place count 121 transition count 150
Iterating global reduction 3 with 4 rules applied. Total rules applied 158 place count 121 transition count 150
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 162 place count 117 transition count 146
Iterating global reduction 3 with 4 rules applied. Total rules applied 166 place count 117 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 115 transition count 144
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 115 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 172 place count 115 transition count 142
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 173 place count 114 transition count 141
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 114 transition count 141
Applied a total of 174 rules in 26 ms. Remains 114 /188 variables (removed 74) and now considering 141/466 (removed 325) transitions.
// Phase 1: matrix 141 rows 114 cols
[2024-06-01 13:13:56] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 13:13:56] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 13:13:56] [INFO ] Invariant cache hit.
[2024-06-01 13:13:56] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-01 13:13:56] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-06-01 13:13:56] [INFO ] Redundant transitions in 2 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 13:13:56] [INFO ] Invariant cache hit.
[2024-06-01 13:13:56] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 1/114 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 13:13:59] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:13:59] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:13:59] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 13:14:00] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 141/255 variables, 114/125 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 62/187 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 13:14:03] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:14:03] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 11 (OVERLAPS) 0/255 variables, 2/189 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 13 (OVERLAPS) 0/255 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 189 constraints, problems are : Problem set: 3 solved, 137 unsolved in 11925 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 3 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 4/114 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 5/13 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 141/255 variables, 114/127 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 62/189 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 137/326 constraints. Problems are: Problem set: 3 solved, 137 unsolved
[2024-06-01 13:14:13] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 1/327 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 0/327 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 12 (OVERLAPS) 0/255 variables, 0/327 constraints. Problems are: Problem set: 3 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 327 constraints, problems are : Problem set: 3 solved, 137 unsolved in 19674 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 137/140 constraints, Known Traps: 9/9 constraints]
After SMT, in 31754ms problems are : Problem set: 3 solved, 137 unsolved
Search for dead transitions found 3 dead transitions in 31756ms
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 : 114/188 places, 138/466 transitions.
Graph (complete) has 365 edges and 114 vertex of which 111 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 5 ms. Remains 111 /114 variables (removed 3) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 111 cols
[2024-06-01 13:14:28] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:14:28] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 13:14:28] [INFO ] Invariant cache hit.
[2024-06-01 13:14:28] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-01 13:14:28] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/188 places, 138/466 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32687 ms. Remains : 111/188 places, 138/466 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-03 finished in 32757 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)||G(F(p2)))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 163 transition count 228
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 163 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 163 transition count 225
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 75 place count 141 transition count 201
Iterating global reduction 1 with 22 rules applied. Total rules applied 97 place count 141 transition count 201
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 105 place count 141 transition count 193
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 120 place count 126 transition count 169
Iterating global reduction 2 with 15 rules applied. Total rules applied 135 place count 126 transition count 169
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 147 place count 126 transition count 157
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 152 place count 121 transition count 152
Iterating global reduction 3 with 5 rules applied. Total rules applied 157 place count 121 transition count 152
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 161 place count 117 transition count 148
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 117 transition count 148
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 167 place count 115 transition count 146
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 115 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 171 place count 115 transition count 144
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 172 place count 114 transition count 143
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 114 transition count 143
Applied a total of 173 rules in 22 ms. Remains 114 /188 variables (removed 74) and now considering 143/466 (removed 323) transitions.
// Phase 1: matrix 143 rows 114 cols
[2024-06-01 13:14:28] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 13:14:29] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 13:14:29] [INFO ] Invariant cache hit.
[2024-06-01 13:14:29] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 13:14:29] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2024-06-01 13:14:29] [INFO ] Redundant transitions in 1 ms returned []
Running 142 sub problems to find dead transitions.
[2024-06-01 13:14:29] [INFO ] Invariant cache hit.
[2024-06-01 13:14:29] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-01 13:14:30] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-01 13:14:32] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 1/114 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-01 13:14:35] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:14:35] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:14:35] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:14:35] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 143/257 variables, 114/128 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 63/191 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-01 13:14:37] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
[2024-06-01 13:14:37] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 13:14:37] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD131 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 3/194 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 13 (OVERLAPS) 0/257 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 194 constraints, problems are : Problem set: 3 solved, 139 unsolved in 13797 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 3 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 6/7 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 4/114 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 3/11 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 6/17 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 143/257 variables, 114/131 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 63/194 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 139/333 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/333 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 11 (OVERLAPS) 0/257 variables, 0/333 constraints. Problems are: Problem set: 3 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 333 constraints, problems are : Problem set: 3 solved, 139 unsolved in 18099 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 139/142 constraints, Known Traps: 12/12 constraints]
After SMT, in 32107ms problems are : Problem set: 3 solved, 139 unsolved
Search for dead transitions found 3 dead transitions in 32109ms
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 : 114/188 places, 140/466 transitions.
Graph (complete) has 367 edges and 114 vertex of which 111 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 7 ms. Remains 111 /114 variables (removed 3) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 111 cols
[2024-06-01 13:15:01] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:15:01] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 13:15:01] [INFO ] Invariant cache hit.
[2024-06-01 13:15:01] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-01 13:15:02] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/188 places, 140/466 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33349 ms. Remains : 111/188 places, 140/466 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-04 finished in 33547 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)||G(p1)))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 162 transition count 213
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 162 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 162 transition count 210
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 79 place count 138 transition count 184
Iterating global reduction 1 with 24 rules applied. Total rules applied 103 place count 138 transition count 184
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 111 place count 138 transition count 176
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 127 place count 122 transition count 151
Iterating global reduction 2 with 16 rules applied. Total rules applied 143 place count 122 transition count 151
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 154 place count 122 transition count 140
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 158 place count 118 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 162 place count 118 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 166 place count 114 transition count 132
Iterating global reduction 3 with 4 rules applied. Total rules applied 170 place count 114 transition count 132
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 112 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 112 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 111 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 111 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 110 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 110 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 109 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 109 transition count 125
Applied a total of 180 rules in 33 ms. Remains 109 /188 variables (removed 79) and now considering 125/466 (removed 341) transitions.
// Phase 1: matrix 125 rows 109 cols
[2024-06-01 13:15:02] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 13:15:02] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 13:15:02] [INFO ] Invariant cache hit.
[2024-06-01 13:15:02] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 13:15:02] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-06-01 13:15:02] [INFO ] Redundant transitions in 2 ms returned []
Running 124 sub problems to find dead transitions.
[2024-06-01 13:15:02] [INFO ] Invariant cache hit.
[2024-06-01 13:15:02] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-01 13:15:04] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:15:04] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:15:04] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 1/109 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-01 13:15:06] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:15:06] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-01 13:15:06] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 125/234 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 49/169 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-01 13:15:09] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:15:10] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:15:10] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 3/172 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 172 constraints, problems are : Problem set: 3 solved, 121 unsolved in 12550 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 3 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 5/6 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 4/109 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 4/14 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 125/234 variables, 109/123 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 49/172 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 121/293 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/293 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/293 constraints. Problems are: Problem set: 3 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 293 constraints, problems are : Problem set: 3 solved, 121 unsolved in 13639 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 121/124 constraints, Known Traps: 9/9 constraints]
After SMT, in 26407ms problems are : Problem set: 3 solved, 121 unsolved
Search for dead transitions found 3 dead transitions in 26410ms
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/188 places, 122/466 transitions.
Graph (complete) has 339 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 6 ms. Remains 106 /109 variables (removed 3) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 106 cols
[2024-06-01 13:15:29] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:15:29] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 13:15:29] [INFO ] Invariant cache hit.
[2024-06-01 13:15:29] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 13:15:29] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/188 places, 122/466 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27500 ms. Remains : 106/188 places, 122/466 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-05 finished in 27612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 161 transition count 224
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 161 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 161 transition count 220
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 81 place count 138 transition count 195
Iterating global reduction 1 with 23 rules applied. Total rules applied 104 place count 138 transition count 195
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 112 place count 138 transition count 187
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 128 place count 122 transition count 162
Iterating global reduction 2 with 16 rules applied. Total rules applied 144 place count 122 transition count 162
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 157 place count 122 transition count 149
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 162 place count 117 transition count 144
Iterating global reduction 3 with 5 rules applied. Total rules applied 167 place count 117 transition count 144
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 172 place count 112 transition count 139
Iterating global reduction 3 with 5 rules applied. Total rules applied 177 place count 112 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 180 place count 109 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 183 place count 109 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 185 place count 109 transition count 134
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 187 place count 107 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 107 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 190 place count 106 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 105 transition count 128
Applied a total of 193 rules in 16 ms. Remains 105 /188 variables (removed 83) and now considering 128/466 (removed 338) transitions.
// Phase 1: matrix 128 rows 105 cols
[2024-06-01 13:15:29] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 13:15:30] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 13:15:30] [INFO ] Invariant cache hit.
[2024-06-01 13:15:30] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 13:15:30] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-06-01 13:15:30] [INFO ] Invariant cache hit.
[2024-06-01 13:15:30] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-06-01 13:15:31] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:15:31] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-06-01 13:15:32] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:15:32] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-06-01 13:15:33] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 1/105 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-06-01 13:15:34] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:15:34] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:15:34] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 128/233 variables, 105/118 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 57/175 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-06-01 13:15:37] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD37 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 1/176 constraints. Problems are: Problem set: 3 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 13 (OVERLAPS) 0/233 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 176 constraints, problems are : Problem set: 3 solved, 124 unsolved in 11692 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 3 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 5/6 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 4/105 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 4/14 constraints. Problems are: Problem set: 3 solved, 124 unsolved
[2024-06-01 13:15:43] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 128/233 variables, 105/120 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 57/177 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 124/301 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/301 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 12 (OVERLAPS) 0/233 variables, 0/301 constraints. Problems are: Problem set: 3 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 301 constraints, problems are : Problem set: 3 solved, 124 unsolved in 13020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 124/127 constraints, Known Traps: 10/10 constraints]
After SMT, in 24850ms problems are : Problem set: 3 solved, 124 unsolved
Search for dead transitions found 3 dead transitions in 24852ms
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 : 105/188 places, 125/466 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 102 transition count 125
Applied a total of 3 rules in 2 ms. Remains 102 /105 variables (removed 3) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2024-06-01 13:15:55] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:15:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 13:15:55] [INFO ] Invariant cache hit.
[2024-06-01 13:15:55] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 13:15:55] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/188 places, 125/466 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25661 ms. Remains : 102/188 places, 125/466 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-07 finished in 25772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||G(((p2||X(p3))&&p1))))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 164 transition count 266
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 164 transition count 266
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 164 transition count 262
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 144 transition count 240
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 144 transition count 240
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 98 place count 144 transition count 234
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 112 place count 130 transition count 213
Iterating global reduction 2 with 14 rules applied. Total rules applied 126 place count 130 transition count 213
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 140 place count 130 transition count 199
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 143 place count 127 transition count 196
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 127 transition count 196
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 124 transition count 193
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 124 transition count 193
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 154 place count 122 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 122 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 121 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 121 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 120 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 120 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 119 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 119 transition count 186
Applied a total of 162 rules in 16 ms. Remains 119 /188 variables (removed 69) and now considering 186/466 (removed 280) transitions.
// Phase 1: matrix 186 rows 119 cols
[2024-06-01 13:15:55] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 13:15:55] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 13:15:55] [INFO ] Invariant cache hit.
[2024-06-01 13:15:56] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-01 13:15:56] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-06-01 13:15:56] [INFO ] Invariant cache hit.
[2024-06-01 13:15:56] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 1/119 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 13:16:00] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 3 ms to minimize.
[2024-06-01 13:16:00] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:16:00] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:16:00] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:16:00] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 13:16:01] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:16:01] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 186/305 variables, 119/131 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 103/234 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-01 13:16:06] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
Problem TDEAD169 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 1/235 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/235 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/305 variables, 0/235 constraints. Problems are: Problem set: 3 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 235 constraints, problems are : Problem set: 3 solved, 182 unsolved in 17311 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 119/119 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 3 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 4/119 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 5/13 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 186/305 variables, 119/132 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 103/235 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 182/417 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/417 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/305 variables, 0/417 constraints. Problems are: Problem set: 3 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 417 constraints, problems are : Problem set: 3 solved, 182 unsolved in 23701 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 119/119 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 182/185 constraints, Known Traps: 8/8 constraints]
After SMT, in 41255ms problems are : Problem set: 3 solved, 182 unsolved
Search for dead transitions found 3 dead transitions in 41258ms
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 : 119/188 places, 183/466 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 183
Applied a total of 3 rules in 1 ms. Remains 116 /119 variables (removed 3) and now considering 183/183 (removed 0) transitions.
// Phase 1: matrix 183 rows 116 cols
[2024-06-01 13:16:37] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 13:16:37] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 13:16:37] [INFO ] Invariant cache hit.
[2024-06-01 13:16:37] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 13:16:38] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 116/188 places, 183/466 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42661 ms. Remains : 116/188 places, 183/466 transitions.
Stuttering acceptance computed with spot in 329 ms :[true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p1) (NOT p3)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p3))), p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-11
Product exploration explored 100000 steps with 22426 reset in 455 ms.
Product exploration explored 100000 steps with 22427 reset in 408 ms.
Computed a total of 19 stabilizing places and 27 stable transitions
Graph (complete) has 414 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3))))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT p1)), (X (OR (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3)))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT p1))), (X (X (OR (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 43 factoid took 113 ms. Reduced automaton from 6 states, 21 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, p0]
RANDOM walk for 40000 steps (8970 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1891 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 160877 steps, run visited all 1 properties in 450 ms. (steps per millisecond=357 )
Probabilistic random walk after 160877 steps, saw 67909 distinct states, run finished after 450 ms. (steps per millisecond=357 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3))))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT p1)), (X (OR (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3)))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT p1))), (X (X (OR (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 43 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-11 finished in 44774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 160 transition count 210
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 160 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 160 transition count 206
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 84 place count 136 transition count 180
Iterating global reduction 1 with 24 rules applied. Total rules applied 108 place count 136 transition count 180
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 116 place count 136 transition count 172
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 132 place count 120 transition count 147
Iterating global reduction 2 with 16 rules applied. Total rules applied 148 place count 120 transition count 147
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 160 place count 120 transition count 135
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 165 place count 115 transition count 130
Iterating global reduction 3 with 5 rules applied. Total rules applied 170 place count 115 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 175 place count 110 transition count 125
Iterating global reduction 3 with 5 rules applied. Total rules applied 180 place count 110 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 183 place count 107 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 186 place count 107 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 187 place count 107 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 189 place count 105 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 191 place count 105 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 104 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 194 place count 103 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 103 transition count 115
Applied a total of 195 rules in 32 ms. Remains 103 /188 variables (removed 85) and now considering 115/466 (removed 351) transitions.
// Phase 1: matrix 115 rows 103 cols
[2024-06-01 13:16:40] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 13:16:40] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 13:16:40] [INFO ] Invariant cache hit.
[2024-06-01 13:16:40] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 13:16:41] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-06-01 13:16:41] [INFO ] Redundant transitions in 1 ms returned []
Running 114 sub problems to find dead transitions.
[2024-06-01 13:16:41] [INFO ] Invariant cache hit.
[2024-06-01 13:16:41] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 13:16:41] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 13:16:42] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 13:16:43] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 13:16:44] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:16:45] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:16:45] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 13:16:45] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 115/218 variables, 103/115 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 45/160 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (OVERLAPS) 0/218 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 160 constraints, problems are : Problem set: 0 solved, 114 unsolved in 9449 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 1/103 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 115/218 variables, 103/115 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 45/160 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 114/274 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 13:16:53] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 1/275 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/275 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 12 (OVERLAPS) 0/218 variables, 0/275 constraints. Problems are: Problem set: 3 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 275 constraints, problems are : Problem set: 3 solved, 111 unsolved in 14218 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 8/8 constraints]
After SMT, in 23801ms problems are : Problem set: 3 solved, 111 unsolved
Search for dead transitions found 3 dead transitions in 23804ms
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 : 103/188 places, 112/466 transitions.
Graph (complete) has 318 edges and 103 vertex of which 100 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 100 /103 variables (removed 3) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 100 cols
[2024-06-01 13:17:04] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:17:05] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 13:17:05] [INFO ] Invariant cache hit.
[2024-06-01 13:17:05] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 13:17:05] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/188 places, 112/466 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24942 ms. Remains : 100/188 places, 112/466 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-13 finished in 25021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X((p1&&X(F(p2)))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 466/466 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 163 transition count 240
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 163 transition count 240
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 163 transition count 236
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 75 place count 142 transition count 213
Iterating global reduction 1 with 21 rules applied. Total rules applied 96 place count 142 transition count 213
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 104 place count 142 transition count 205
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 118 place count 128 transition count 183
Iterating global reduction 2 with 14 rules applied. Total rules applied 132 place count 128 transition count 183
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 144 place count 128 transition count 171
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 125 transition count 168
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 125 transition count 168
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 122 transition count 165
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 122 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 120 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 120 transition count 163
Applied a total of 160 rules in 22 ms. Remains 120 /188 variables (removed 68) and now considering 163/466 (removed 303) transitions.
// Phase 1: matrix 163 rows 120 cols
[2024-06-01 13:17:05] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 13:17:05] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-01 13:17:05] [INFO ] Invariant cache hit.
[2024-06-01 13:17:05] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-06-01 13:17:06] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-06-01 13:17:06] [INFO ] Invariant cache hit.
[2024-06-01 13:17:06] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 13:17:08] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:17:08] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 13:17:09] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 1/120 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 13:17:11] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-06-01 13:17:11] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:17:11] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:17:11] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:17:11] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 163/283 variables, 120/133 constraints. Problems are: Problem set: 0 solved, 162 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 80/213 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (OVERLAPS) 0/283 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 213 constraints, problems are : Problem set: 0 solved, 162 unsolved in 12697 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 120/120 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 1/120 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 163/283 variables, 120/133 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 80/213 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 162/375 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 13:17:26] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:17:27] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:17:27] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD149 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 3/378 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/378 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 12 (OVERLAPS) 0/283 variables, 0/378 constraints. Problems are: Problem set: 3 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 378 constraints, problems are : Problem set: 3 solved, 159 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 120/120 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 11/11 constraints]
After SMT, in 43045ms problems are : Problem set: 3 solved, 159 unsolved
Search for dead transitions found 3 dead transitions in 43048ms
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 : 120/188 places, 160/466 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 160
Applied a total of 3 rules in 1 ms. Remains 117 /120 variables (removed 3) and now considering 160/160 (removed 0) transitions.
// Phase 1: matrix 160 rows 117 cols
[2024-06-01 13:17:49] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:17:49] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 13:17:49] [INFO ] Invariant cache hit.
[2024-06-01 13:17:49] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-01 13:17:49] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/188 places, 160/466 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44440 ms. Remains : 117/188 places, 160/466 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-15 finished in 44816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p1)&&X(!p1))))'
[2024-06-01 13:17:50] [INFO ] Flatten gal took : 63 ms
[2024-06-01 13:17:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 13:17:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 188 places, 466 transitions and 1844 arcs took 9 ms.
Total runtime 468502 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717247875533

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name SieveSingleMsgMbox-PT-d2m06-LTLFireability-02
ltl formula formula --ltl=/tmp/1494/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 188 places, 466 transitions and 1844 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1494/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1494/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1494/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1494/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 190 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 189, there are 478 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~128 levels ~10000 states ~22432 transitions
pnml2lts-mc( 1/ 4): ~128 levels ~20000 states ~43052 transitions
pnml2lts-mc( 1/ 4): ~163 levels ~40000 states ~92384 transitions
pnml2lts-mc( 2/ 4): ~249 levels ~80000 states ~183068 transitions
pnml2lts-mc( 2/ 4): ~393 levels ~160000 states ~381056 transitions
pnml2lts-mc( 3/ 4): ~384 levels ~320000 states ~763876 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 393151
pnml2lts-mc( 0/ 4): unique states count: 410219
pnml2lts-mc( 0/ 4): unique transitions count: 1015375
pnml2lts-mc( 0/ 4): - self-loop count: 311842
pnml2lts-mc( 0/ 4): - claim dead count: 281818
pnml2lts-mc( 0/ 4): - claim found count: 28176
pnml2lts-mc( 0/ 4): - claim success count: 414990
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1657
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 417183 states 1057487 transitions, fanout: 2.535
pnml2lts-mc( 0/ 4): Total exploration time 3.890 sec (3.890 sec minimum, 3.890 sec on average)
pnml2lts-mc( 0/ 4): States per second: 107245, Transitions per second: 271848
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 4.6MB, 11.9 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 471 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 4.6MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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