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.r333-tall-171679077600060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is RingSingleMessageInMbox-PT-d1m005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679077600060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 13 00:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 13 00:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 00:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 00:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 RingSingleMessageInMbox-PT-d1m005-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716793159189

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 06:59:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 06:59:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 06:59:20] [INFO ] Load time of PNML (sax parser for PT used): 479 ms
[2024-05-27 06:59:20] [INFO ] Transformed 6690 places.
[2024-05-27 06:59:20] [INFO ] Transformed 11934 transitions.
[2024-05-27 06:59:20] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 641 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 4305 places in 41 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1083 places :
Symmetric choice reduction at 1 with 1083 rule applications. Total rules 1202 place count 1285 transition count 7347
Iterating global reduction 1 with 1083 rules applied. Total rules applied 2285 place count 1285 transition count 7347
Ensure Unique test removed 294 transitions
Reduce isomorphic transitions removed 294 transitions.
Iterating post reduction 1 with 294 rules applied. Total rules applied 2579 place count 1285 transition count 7053
Discarding 854 places :
Symmetric choice reduction at 2 with 854 rule applications. Total rules 3433 place count 431 transition count 6199
Iterating global reduction 2 with 854 rules applied. Total rules applied 4287 place count 431 transition count 6199
Ensure Unique test removed 4537 transitions
Reduce isomorphic transitions removed 4537 transitions.
Iterating post reduction 2 with 4537 rules applied. Total rules applied 8824 place count 431 transition count 1662
Discarding 82 places :
Symmetric choice reduction at 3 with 82 rule applications. Total rules 8906 place count 349 transition count 1580
Iterating global reduction 3 with 82 rules applied. Total rules applied 8988 place count 349 transition count 1580
Ensure Unique test removed 260 transitions
Reduce isomorphic transitions removed 260 transitions.
Iterating post reduction 3 with 260 rules applied. Total rules applied 9248 place count 349 transition count 1320
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 9256 place count 341 transition count 1312
Iterating global reduction 4 with 8 rules applied. Total rules applied 9264 place count 341 transition count 1312
Applied a total of 9264 rules in 423 ms. Remains 341 /2385 variables (removed 2044) and now considering 1312/11934 (removed 10622) transitions.
// Phase 1: matrix 1312 rows 341 cols
[2024-05-27 06:59:21] [INFO ] Computed 3 invariants in 30 ms
[2024-05-27 06:59:22] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-27 06:59:22] [INFO ] Invariant cache hit.
[2024-05-27 06:59:22] [INFO ] State equation strengthened by 1002 read => feed constraints.
[2024-05-27 06:59:24] [INFO ] Implicit Places using invariants and state equation in 2237 ms returned []
Implicit Place search using SMT with State Equation took 2814 ms to find 0 implicit places.
Running 1311 sub problems to find dead transitions.
[2024-05-27 06:59:24] [INFO ] Invariant cache hit.
[2024-05-27 06:59:24] [INFO ] State equation strengthened by 1002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (OVERLAPS) 1/341 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
SMT process timed out in 36446ms, After SMT, problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 36481ms
Starting structural reductions in LTL mode, iteration 1 : 341/2385 places, 1312/11934 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39761 ms. Remains : 341/2385 places, 1312/11934 transitions.
Support contains 31 out of 341 places after structural reductions.
[2024-05-27 07:00:01] [INFO ] Flatten gal took : 107 ms
[2024-05-27 07:00:01] [INFO ] Flatten gal took : 73 ms
[2024-05-27 07:00:01] [INFO ] Input system was already deterministic with 1312 transitions.
Support contains 28 out of 341 places (down from 31) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (6970 resets) in 2759 ms. (14 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40004 steps (658 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
[2024-05-27 07:00:02] [INFO ] Invariant cache hit.
[2024-05-27 07:00:02] [INFO ] State equation strengthened by 1002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/153 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 430/583 variables, 153/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 120/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 1653/1653 variables, and 464 constraints, problems are : Problem set: 1 solved, 0 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 341/341 constraints, ReadFeed: 120/1002 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 399ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 84 stabilizing places and 574 stable transitions
Graph (complete) has 2011 edges and 341 vertex of which 340 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((G(F(p2))||p1)))))'
Support contains 4 out of 341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 1312/1312 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 317 transition count 616
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 317 transition count 616
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 317 transition count 614
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 110 place count 257 transition count 554
Iterating global reduction 1 with 60 rules applied. Total rules applied 170 place count 257 transition count 554
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 248 place count 257 transition count 476
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 312 place count 193 transition count 412
Iterating global reduction 2 with 64 rules applied. Total rules applied 376 place count 193 transition count 412
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 468 place count 193 transition count 320
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 469 place count 192 transition count 307
Iterating global reduction 3 with 1 rules applied. Total rules applied 470 place count 192 transition count 307
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 471 place count 191 transition count 306
Iterating global reduction 3 with 1 rules applied. Total rules applied 472 place count 191 transition count 306
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 476 place count 187 transition count 302
Iterating global reduction 3 with 4 rules applied. Total rules applied 480 place count 187 transition count 302
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 500 place count 187 transition count 282
Applied a total of 500 rules in 32 ms. Remains 187 /341 variables (removed 154) and now considering 282/1312 (removed 1030) transitions.
// Phase 1: matrix 282 rows 187 cols
[2024-05-27 07:00:03] [INFO ] Computed 3 invariants in 10 ms
[2024-05-27 07:00:03] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-27 07:00:03] [INFO ] Invariant cache hit.
[2024-05-27 07:00:03] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-27 07:00:03] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-05-27 07:00:03] [INFO ] Invariant cache hit.
[2024-05-27 07:00:03] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 4 (OVERLAPS) 282/469 variables, 187/190 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 107/297 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/297 constraints. Problems are: Problem set: 24 solved, 257 unsolved
[2024-05-27 07:00:13] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 14 ms to minimize.
[2024-05-27 07:00:13] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/469 variables, 2/299 constraints. Problems are: Problem set: 24 solved, 257 unsolved
[2024-05-27 07:00:16] [INFO ] Deduced a trap composed of 112 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 1/300 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/300 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 10 (OVERLAPS) 0/469 variables, 0/300 constraints. Problems are: Problem set: 24 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 300 constraints, problems are : Problem set: 24 solved, 257 unsolved in 19874 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 24 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 17/179 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 2/4 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 8/187 variables, 1/5 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 1/6 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/6 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 282/469 variables, 187/193 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 107/300 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 257/557 constraints. Problems are: Problem set: 24 solved, 257 unsolved
[2024-05-27 07:00:32] [INFO ] Deduced a trap composed of 111 places in 68 ms of which 2 ms to minimize.
[2024-05-27 07:00:32] [INFO ] Deduced a trap composed of 100 places in 67 ms of which 1 ms to minimize.
[2024-05-27 07:00:32] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-05-27 07:00:33] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 2 ms to minimize.
[2024-05-27 07:00:33] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
[2024-05-27 07:00:33] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 2 ms to minimize.
[2024-05-27 07:00:33] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
[2024-05-27 07:00:35] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 2 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
[2024-05-27 07:00:36] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
Problem TDEAD229 is UNSAT
[2024-05-27 07:00:36] [INFO ] Deduced a trap composed of 108 places in 63 ms of which 2 ms to minimize.
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
[2024-05-27 07:00:37] [INFO ] Deduced a trap composed of 93 places in 66 ms of which 2 ms to minimize.
[2024-05-27 07:00:37] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 2 ms to minimize.
[2024-05-27 07:00:37] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 2 ms to minimize.
[2024-05-27 07:00:37] [INFO ] Deduced a trap composed of 108 places in 60 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 14/571 constraints. Problems are: Problem set: 46 solved, 235 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/469 variables, 0/571 constraints. Problems are: Problem set: 46 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 571 constraints, problems are : Problem set: 46 solved, 235 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 257/281 constraints, Known Traps: 17/17 constraints]
After SMT, in 50409ms problems are : Problem set: 46 solved, 235 unsolved
Search for dead transitions found 46 dead transitions in 50413ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 187/341 places, 236/1312 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 145 transition count 218
Applied a total of 60 rules in 4 ms. Remains 145 /187 variables (removed 42) and now considering 218/236 (removed 18) transitions.
// Phase 1: matrix 218 rows 145 cols
[2024-05-27 07:00:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:00:54] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-27 07:00:54] [INFO ] Invariant cache hit.
[2024-05-27 07:00:54] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-27 07:00:54] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 145/341 places, 218/1312 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51432 ms. Remains : 145/341 places, 218/1312 transitions.
Stuttering acceptance computed with spot in 431 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 307 ms.
Product exploration explored 100000 steps with 33333 reset in 240 ms.
Computed a total of 20 stabilizing places and 80 stable transitions
Graph (complete) has 516 edges and 145 vertex of which 144 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 20 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-00 finished in 52502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 1312/1312 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 315 transition count 534
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 315 transition count 534
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 315 transition count 531
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 116 place count 254 transition count 470
Iterating global reduction 1 with 61 rules applied. Total rules applied 177 place count 254 transition count 470
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 230 place count 254 transition count 417
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 302 place count 182 transition count 345
Iterating global reduction 2 with 72 rules applied. Total rules applied 374 place count 182 transition count 345
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 442 place count 182 transition count 277
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 444 place count 180 transition count 251
Iterating global reduction 3 with 2 rules applied. Total rules applied 446 place count 180 transition count 251
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 447 place count 179 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 448 place count 179 transition count 250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 452 place count 175 transition count 246
Iterating global reduction 3 with 4 rules applied. Total rules applied 456 place count 175 transition count 246
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 464 place count 175 transition count 238
Applied a total of 464 rules in 63 ms. Remains 175 /341 variables (removed 166) and now considering 238/1312 (removed 1074) transitions.
// Phase 1: matrix 238 rows 175 cols
[2024-05-27 07:00:55] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 07:00:55] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-27 07:00:55] [INFO ] Invariant cache hit.
[2024-05-27 07:00:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 07:00:56] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2024-05-27 07:00:56] [INFO ] Redundant transitions in 13 ms returned []
Running 237 sub problems to find dead transitions.
[2024-05-27 07:00:56] [INFO ] Invariant cache hit.
[2024-05-27 07:00:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
At refinement iteration 4 (OVERLAPS) 238/413 variables, 175/178 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 72/250 constraints. Problems are: Problem set: 24 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/250 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/413 variables, 0/250 constraints. Problems are: Problem set: 24 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 250 constraints, problems are : Problem set: 24 solved, 213 unsolved in 7967 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 17/167 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 8/175 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 238/413 variables, 175/178 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 72/250 constraints. Problems are: Problem set: 24 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 213/463 constraints. Problems are: Problem set: 24 solved, 213 unsolved
[2024-05-27 07:01:10] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2024-05-27 07:01:10] [INFO ] Deduced a trap composed of 89 places in 50 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-27 07:01:11] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
[2024-05-27 07:01:12] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 1 ms to minimize.
[2024-05-27 07:01:13] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
[2024-05-27 07:01:13] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 1 ms to minimize.
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
[2024-05-27 07:01:13] [INFO ] Deduced a trap composed of 101 places in 59 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
[2024-05-27 07:01:13] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 1 ms to minimize.
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
[2024-05-27 07:01:13] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
[2024-05-27 07:01:13] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 2 ms to minimize.
[2024-05-27 07:01:14] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 11/474 constraints. Problems are: Problem set: 46 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/474 constraints. Problems are: Problem set: 46 solved, 191 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/474 constraints. Problems are: Problem set: 46 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 474 constraints, problems are : Problem set: 46 solved, 191 unsolved in 25459 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 213/237 constraints, Known Traps: 11/11 constraints]
After SMT, in 33847ms problems are : Problem set: 46 solved, 191 unsolved
Search for dead transitions found 46 dead transitions in 33851ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 175/341 places, 192/1312 transitions.
Graph (complete) has 504 edges and 175 vertex of which 133 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.7 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 133 transition count 174
Applied a total of 19 rules in 24 ms. Remains 133 /175 variables (removed 42) and now considering 174/192 (removed 18) transitions.
// Phase 1: matrix 174 rows 133 cols
[2024-05-27 07:01:30] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:01:30] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-27 07:01:30] [INFO ] Invariant cache hit.
[2024-05-27 07:01:30] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-27 07:01:30] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 133/341 places, 174/1312 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 34860 ms. Remains : 133/341 places, 174/1312 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-01
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-01 finished in 34919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 1312/1312 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 315 transition count 574
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 315 transition count 574
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 315 transition count 571
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 116 place count 254 transition count 510
Iterating global reduction 1 with 61 rules applied. Total rules applied 177 place count 254 transition count 510
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 243 place count 254 transition count 444
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 311 place count 186 transition count 376
Iterating global reduction 2 with 68 rules applied. Total rules applied 379 place count 186 transition count 376
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 455 place count 186 transition count 300
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 457 place count 184 transition count 274
Iterating global reduction 3 with 2 rules applied. Total rules applied 459 place count 184 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 460 place count 183 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 461 place count 183 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 462 place count 183 transition count 272
Applied a total of 462 rules in 24 ms. Remains 183 /341 variables (removed 158) and now considering 272/1312 (removed 1040) transitions.
// Phase 1: matrix 272 rows 183 cols
[2024-05-27 07:01:30] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 07:01:30] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-27 07:01:30] [INFO ] Invariant cache hit.
[2024-05-27 07:01:30] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-27 07:01:31] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-05-27 07:01:31] [INFO ] Invariant cache hit.
[2024-05-27 07:01:31] [INFO ] State equation strengthened by 99 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
At refinement iteration 4 (OVERLAPS) 272/455 variables, 183/186 constraints. Problems are: Problem set: 24 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 99/285 constraints. Problems are: Problem set: 24 solved, 247 unsolved
[2024-05-27 07:01:35] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-27 07:01:36] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
[2024-05-27 07:01:37] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-27 07:01:37] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 4/289 constraints. Problems are: Problem set: 44 solved, 227 unsolved
[2024-05-27 07:01:39] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 1 ms to minimize.
[2024-05-27 07:01:40] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 2 ms to minimize.
[2024-05-27 07:01:40] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 3 ms to minimize.
[2024-05-27 07:01:40] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 4/293 constraints. Problems are: Problem set: 44 solved, 227 unsolved
[2024-05-27 07:01:42] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 1 ms to minimize.
[2024-05-27 07:01:42] [INFO ] Deduced a trap composed of 115 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 2/295 constraints. Problems are: Problem set: 44 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/295 constraints. Problems are: Problem set: 44 solved, 227 unsolved
At refinement iteration 10 (OVERLAPS) 0/455 variables, 0/295 constraints. Problems are: Problem set: 44 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 295 constraints, problems are : Problem set: 44 solved, 227 unsolved in 16781 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 44 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 2/2 constraints. Problems are: Problem set: 44 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 44 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 25/167 variables, 2/4 constraints. Problems are: Problem set: 44 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 1/5 constraints. Problems are: Problem set: 44 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 44 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 16/183 variables, 1/6 constraints. Problems are: Problem set: 44 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 7/13 constraints. Problems are: Problem set: 44 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/13 constraints. Problems are: Problem set: 44 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 272/455 variables, 183/196 constraints. Problems are: Problem set: 44 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 99/295 constraints. Problems are: Problem set: 44 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 227/522 constraints. Problems are: Problem set: 44 solved, 227 unsolved
[2024-05-27 07:01:55] [INFO ] Deduced a trap composed of 108 places in 69 ms of which 1 ms to minimize.
[2024-05-27 07:01:55] [INFO ] Deduced a trap composed of 101 places in 57 ms of which 1 ms to minimize.
[2024-05-27 07:02:00] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 2 ms to minimize.
[2024-05-27 07:02:00] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
Problem TDEAD215 is UNSAT
[2024-05-27 07:02:01] [INFO ] Deduced a trap composed of 112 places in 60 ms of which 1 ms to minimize.
[2024-05-27 07:02:01] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 2 ms to minimize.
Problem TDEAD219 is UNSAT
[2024-05-27 07:02:01] [INFO ] Deduced a trap composed of 93 places in 63 ms of which 1 ms to minimize.
[2024-05-27 07:02:01] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
[2024-05-27 07:02:01] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 9/531 constraints. Problems are: Problem set: 46 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 0/531 constraints. Problems are: Problem set: 46 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/455 variables, and 531 constraints, problems are : Problem set: 46 solved, 225 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 227/271 constraints, Known Traps: 19/19 constraints]
After SMT, in 47326ms problems are : Problem set: 46 solved, 225 unsolved
Search for dead transitions found 46 dead transitions in 47330ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 183/341 places, 226/1312 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 141 transition count 208
Applied a total of 60 rules in 2 ms. Remains 141 /183 variables (removed 42) and now considering 208/226 (removed 18) transitions.
// Phase 1: matrix 208 rows 141 cols
[2024-05-27 07:02:18] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:02:18] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-27 07:02:18] [INFO ] Invariant cache hit.
[2024-05-27 07:02:18] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-27 07:02:18] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/341 places, 208/1312 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48221 ms. Remains : 141/341 places, 208/1312 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-02
Entered a terminal (fully accepting) state of product in 261 steps with 46 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-02 finished in 48371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 1312/1312 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 316 transition count 575
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 316 transition count 575
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 316 transition count 572
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 94 place count 275 transition count 531
Iterating global reduction 1 with 41 rules applied. Total rules applied 135 place count 275 transition count 531
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 170 place count 275 transition count 496
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 255 place count 190 transition count 411
Iterating global reduction 2 with 85 rules applied. Total rules applied 340 place count 190 transition count 411
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 440 place count 190 transition count 311
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 442 place count 188 transition count 281
Iterating global reduction 3 with 2 rules applied. Total rules applied 444 place count 188 transition count 281
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 445 place count 187 transition count 280
Iterating global reduction 3 with 1 rules applied. Total rules applied 446 place count 187 transition count 280
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 451 place count 182 transition count 275
Iterating global reduction 3 with 5 rules applied. Total rules applied 456 place count 182 transition count 275
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 471 place count 182 transition count 260
Applied a total of 471 rules in 47 ms. Remains 182 /341 variables (removed 159) and now considering 260/1312 (removed 1052) transitions.
// Phase 1: matrix 260 rows 182 cols
[2024-05-27 07:02:18] [INFO ] Computed 3 invariants in 12 ms
[2024-05-27 07:02:19] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-27 07:02:19] [INFO ] Invariant cache hit.
[2024-05-27 07:02:19] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-27 07:02:19] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2024-05-27 07:02:19] [INFO ] Redundant transitions in 12 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-27 07:02:19] [INFO ] Invariant cache hit.
[2024-05-27 07:02:19] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 1/182 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
At refinement iteration 5 (OVERLAPS) 260/442 variables, 182/185 constraints. Problems are: Problem set: 24 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 89/274 constraints. Problems are: Problem set: 24 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/274 constraints. Problems are: Problem set: 24 solved, 235 unsolved
At refinement iteration 8 (OVERLAPS) 0/442 variables, 0/274 constraints. Problems are: Problem set: 24 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 274 constraints, problems are : Problem set: 24 solved, 235 unsolved in 10580 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 182/182 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 24 solved, 235 unsolved
At refinement iteration 3 (OVERLAPS) 24/182 variables, 2/3 constraints. Problems are: Problem set: 24 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 260/442 variables, 182/185 constraints. Problems are: Problem set: 24 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 89/274 constraints. Problems are: Problem set: 24 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 235/509 constraints. Problems are: Problem set: 24 solved, 235 unsolved
[2024-05-27 07:02:37] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2024-05-27 07:02:37] [INFO ] Deduced a trap composed of 106 places in 67 ms of which 2 ms to minimize.
[2024-05-27 07:02:38] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
[2024-05-27 07:02:38] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 2 ms to minimize.
[2024-05-27 07:02:38] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 2 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
[2024-05-27 07:02:38] [INFO ] Deduced a trap composed of 108 places in 64 ms of which 2 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
[2024-05-27 07:02:41] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-05-27 07:02:41] [INFO ] Deduced a trap composed of 100 places in 67 ms of which 1 ms to minimize.
[2024-05-27 07:02:41] [INFO ] Deduced a trap composed of 109 places in 66 ms of which 2 ms to minimize.
[2024-05-27 07:02:41] [INFO ] Deduced a trap composed of 91 places in 66 ms of which 5 ms to minimize.
Problem TDEAD207 is UNSAT
[2024-05-27 07:02:41] [INFO ] Deduced a trap composed of 108 places in 65 ms of which 1 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
[2024-05-27 07:02:41] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 1 ms to minimize.
[2024-05-27 07:02:42] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 13/522 constraints. Problems are: Problem set: 46 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/522 constraints. Problems are: Problem set: 46 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/442 variables, 0/522 constraints. Problems are: Problem set: 46 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 522 constraints, problems are : Problem set: 46 solved, 213 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 182/182 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 235/259 constraints, Known Traps: 13/13 constraints]
After SMT, in 41034ms problems are : Problem set: 46 solved, 213 unsolved
Search for dead transitions found 46 dead transitions in 41036ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 182/341 places, 214/1312 transitions.
Graph (complete) has 539 edges and 182 vertex of which 140 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 140 transition count 196
Applied a total of 19 rules in 8 ms. Remains 140 /182 variables (removed 42) and now considering 196/214 (removed 18) transitions.
// Phase 1: matrix 196 rows 140 cols
[2024-05-27 07:03:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:03:00] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 07:03:00] [INFO ] Invariant cache hit.
[2024-05-27 07:03:00] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-27 07:03:00] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 140/341 places, 196/1312 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42051 ms. Remains : 140/341 places, 196/1312 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-03
Product exploration explored 100000 steps with 18439 reset in 252 ms.
Product exploration explored 100000 steps with 18410 reset in 211 ms.
Computed a total of 13 stabilizing places and 55 stable transitions
Graph (complete) has 487 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 13 stabilizing places and 55 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 151 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1678 steps (313 resets) in 24 ms. (67 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 196/196 transitions.
Applied a total of 0 rules in 10 ms. Remains 140 /140 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-27 07:03:02] [INFO ] Invariant cache hit.
[2024-05-27 07:03:02] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-27 07:03:02] [INFO ] Invariant cache hit.
[2024-05-27 07:03:02] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-27 07:03:02] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-05-27 07:03:02] [INFO ] Redundant transitions in 1 ms returned []
Running 195 sub problems to find dead transitions.
[2024-05-27 07:03:02] [INFO ] Invariant cache hit.
[2024-05-27 07:03:02] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/336 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 81/223 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-27 07:03:08] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/336 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 224 constraints, problems are : Problem set: 0 solved, 195 unsolved in 10259 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/336 variables, 140/143 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 81/224 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 195/419 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-27 07:03:18] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
[2024-05-27 07:03:18] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 0 ms to minimize.
[2024-05-27 07:03:19] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 2 ms to minimize.
[2024-05-27 07:03:19] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 423 constraints, problems are : Problem set: 0 solved, 195 unsolved in 17705 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 5/5 constraints]
After SMT, in 28201ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 28203ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28603 ms. Remains : 140/140 places, 196/196 transitions.
Computed a total of 13 stabilizing places and 55 stable transitions
Graph (complete) has 487 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 55 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 129 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 6468 steps (1170 resets) in 62 ms. (102 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 215 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 18409 reset in 156 ms.
Product exploration explored 100000 steps with 18410 reset in 161 ms.
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-27 07:03:31] [INFO ] Invariant cache hit.
[2024-05-27 07:03:31] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 07:03:31] [INFO ] Invariant cache hit.
[2024-05-27 07:03:32] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-27 07:03:32] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-27 07:03:32] [INFO ] Redundant transitions in 1 ms returned []
Running 195 sub problems to find dead transitions.
[2024-05-27 07:03:32] [INFO ] Invariant cache hit.
[2024-05-27 07:03:32] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/336 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 81/223 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-27 07:03:37] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/336 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 224 constraints, problems are : Problem set: 0 solved, 195 unsolved in 10065 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/336 variables, 140/143 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 81/224 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 195/419 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-27 07:03:48] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:03:48] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-27 07:03:48] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-27 07:03:48] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 423 constraints, problems are : Problem set: 0 solved, 195 unsolved in 17930 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 5/5 constraints]
After SMT, in 28252ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 28255ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28661 ms. Remains : 140/140 places, 196/196 transitions.
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-03 finished in 101846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (!p0&&G(p1))))'
Support contains 3 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 1312/1312 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 316 transition count 615
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 316 transition count 615
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 316 transition count 612
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 113 place count 256 transition count 552
Iterating global reduction 1 with 60 rules applied. Total rules applied 173 place count 256 transition count 552
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 251 place count 256 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 315 place count 192 transition count 410
Iterating global reduction 2 with 64 rules applied. Total rules applied 379 place count 192 transition count 410
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 471 place count 192 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 472 place count 191 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 473 place count 191 transition count 305
Applied a total of 473 rules in 92 ms. Remains 191 /341 variables (removed 150) and now considering 305/1312 (removed 1007) transitions.
// Phase 1: matrix 305 rows 191 cols
[2024-05-27 07:04:00] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 07:04:01] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-27 07:04:01] [INFO ] Invariant cache hit.
[2024-05-27 07:04:01] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-27 07:04:01] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2024-05-27 07:04:01] [INFO ] Redundant transitions in 1 ms returned []
Running 304 sub problems to find dead transitions.
[2024-05-27 07:04:01] [INFO ] Invariant cache hit.
[2024-05-27 07:04:01] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
At refinement iteration 4 (OVERLAPS) 305/496 variables, 191/194 constraints. Problems are: Problem set: 24 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 126/320 constraints. Problems are: Problem set: 24 solved, 280 unsolved
[2024-05-27 07:04:08] [INFO ] Deduced a trap composed of 114 places in 80 ms of which 1 ms to minimize.
[2024-05-27 07:04:09] [INFO ] Deduced a trap composed of 117 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 2/322 constraints. Problems are: Problem set: 24 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 0/322 constraints. Problems are: Problem set: 24 solved, 280 unsolved
[2024-05-27 07:04:14] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 2 ms to minimize.
[2024-05-27 07:04:14] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:04:14] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 1 ms to minimize.
[2024-05-27 07:04:14] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-27 07:04:14] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/496 variables, 5/327 constraints. Problems are: Problem set: 44 solved, 260 unsolved
[2024-05-27 07:04:18] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
Problem TDEAD248 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 1/328 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/328 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 11 (OVERLAPS) 0/496 variables, 0/328 constraints. Problems are: Problem set: 45 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 328 constraints, problems are : Problem set: 45 solved, 259 unsolved in 27007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 191/191 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 45 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 26/175 variables, 2/2 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 16/191 variables, 1/3 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 8/11 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/11 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 305/496 variables, 191/202 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 126/328 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 259/587 constraints. Problems are: Problem set: 45 solved, 259 unsolved
[2024-05-27 07:04:38] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
Problem TDEAD252 is UNSAT
[2024-05-27 07:04:42] [INFO ] Deduced a trap composed of 100 places in 71 ms of which 2 ms to minimize.
[2024-05-27 07:04:43] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2024-05-27 07:04:43] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 2 ms to minimize.
[2024-05-27 07:04:43] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 1 ms to minimize.
[2024-05-27 07:04:43] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 6/593 constraints. Problems are: Problem set: 46 solved, 258 unsolved
[2024-05-27 07:04:48] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 1/594 constraints. Problems are: Problem set: 46 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 594 constraints, problems are : Problem set: 46 solved, 258 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 191/191 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 259/304 constraints, Known Traps: 15/15 constraints]
After SMT, in 57580ms problems are : Problem set: 46 solved, 258 unsolved
Search for dead transitions found 46 dead transitions in 57583ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 191/341 places, 259/1312 transitions.
Graph (complete) has 600 edges and 191 vertex of which 149 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 149 transition count 241
Applied a total of 19 rules in 14 ms. Remains 149 /191 variables (removed 42) and now considering 241/259 (removed 18) transitions.
// Phase 1: matrix 241 rows 149 cols
[2024-05-27 07:04:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:04:59] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-27 07:04:59] [INFO ] Invariant cache hit.
[2024-05-27 07:04:59] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-05-27 07:04:59] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 149/341 places, 241/1312 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58878 ms. Remains : 149/341 places, 241/1312 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) p0), true, (NOT p1), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-05 finished in 59034 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((F(G(p0)) U p1))))'
Support contains 3 out of 341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 1312/1312 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 316 transition count 623
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 316 transition count 623
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 57 place count 316 transition count 616
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 117 place count 256 transition count 556
Iterating global reduction 1 with 60 rules applied. Total rules applied 177 place count 256 transition count 556
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 259 place count 256 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 323 place count 192 transition count 410
Iterating global reduction 2 with 64 rules applied. Total rules applied 387 place count 192 transition count 410
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 479 place count 192 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 480 place count 191 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 481 place count 191 transition count 305
Applied a total of 481 rules in 34 ms. Remains 191 /341 variables (removed 150) and now considering 305/1312 (removed 1007) transitions.
// Phase 1: matrix 305 rows 191 cols
[2024-05-27 07:04:59] [INFO ] Computed 3 invariants in 5 ms
[2024-05-27 07:04:59] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-27 07:04:59] [INFO ] Invariant cache hit.
[2024-05-27 07:05:00] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-27 07:05:00] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2024-05-27 07:05:00] [INFO ] Invariant cache hit.
[2024-05-27 07:05:00] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
At refinement iteration 4 (OVERLAPS) 305/496 variables, 191/194 constraints. Problems are: Problem set: 24 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 126/320 constraints. Problems are: Problem set: 24 solved, 280 unsolved
[2024-05-27 07:05:06] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 1 ms to minimize.
[2024-05-27 07:05:06] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
[2024-05-27 07:05:07] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
Problem TDEAD113 is UNSAT
[2024-05-27 07:05:07] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
[2024-05-27 07:05:08] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 1 ms to minimize.
[2024-05-27 07:05:08] [INFO ] Deduced a trap composed of 102 places in 70 ms of which 1 ms to minimize.
[2024-05-27 07:05:09] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 7/327 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 0/327 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 0/496 variables, 0/327 constraints. Problems are: Problem set: 45 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 327 constraints, problems are : Problem set: 45 solved, 259 unsolved in 18039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 191/191 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 45 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 26/175 variables, 2/2 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 1/3 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 16/191 variables, 1/4 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 6/10 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/10 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 305/496 variables, 191/201 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 126/327 constraints. Problems are: Problem set: 45 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 259/586 constraints. Problems are: Problem set: 45 solved, 259 unsolved
[2024-05-27 07:05:33] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 1 ms to minimize.
[2024-05-27 07:05:33] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
Problem TDEAD252 is UNSAT
[2024-05-27 07:05:34] [INFO ] Deduced a trap composed of 100 places in 63 ms of which 1 ms to minimize.
[2024-05-27 07:05:34] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 2 ms to minimize.
[2024-05-27 07:05:34] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 5/591 constraints. Problems are: Problem set: 46 solved, 258 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 0/591 constraints. Problems are: Problem set: 46 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 591 constraints, problems are : Problem set: 46 solved, 258 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 191/191 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 259/304 constraints, Known Traps: 12/12 constraints]
After SMT, in 48661ms problems are : Problem set: 46 solved, 258 unsolved
Search for dead transitions found 46 dead transitions in 48663ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 191/341 places, 259/1312 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 149 transition count 241
Applied a total of 60 rules in 2 ms. Remains 149 /191 variables (removed 42) and now considering 241/259 (removed 18) transitions.
// Phase 1: matrix 241 rows 149 cols
[2024-05-27 07:05:49] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:05:49] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-27 07:05:49] [INFO ] Invariant cache hit.
[2024-05-27 07:05:49] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-05-27 07:05:49] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/341 places, 241/1312 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49976 ms. Remains : 149/341 places, 241/1312 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-06
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-06 finished in 50135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 5 out of 341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 1312/1312 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 317 transition count 620
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 317 transition count 620
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 317 transition count 615
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 112 place count 258 transition count 556
Iterating global reduction 1 with 59 rules applied. Total rules applied 171 place count 258 transition count 556
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 250 place count 258 transition count 477
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 314 place count 194 transition count 413
Iterating global reduction 2 with 64 rules applied. Total rules applied 378 place count 194 transition count 413
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 466 place count 194 transition count 325
Applied a total of 466 rules in 18 ms. Remains 194 /341 variables (removed 147) and now considering 325/1312 (removed 987) transitions.
// Phase 1: matrix 325 rows 194 cols
[2024-05-27 07:05:49] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 07:05:50] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-27 07:05:50] [INFO ] Invariant cache hit.
[2024-05-27 07:05:50] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-27 07:05:50] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2024-05-27 07:05:50] [INFO ] Invariant cache hit.
[2024-05-27 07:05:50] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/194 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
At refinement iteration 4 (OVERLAPS) 325/519 variables, 194/197 constraints. Problems are: Problem set: 24 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 144/341 constraints. Problems are: Problem set: 24 solved, 300 unsolved
[2024-05-27 07:05:57] [INFO ] Deduced a trap composed of 101 places in 57 ms of which 2 ms to minimize.
[2024-05-27 07:05:57] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 2 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
[2024-05-27 07:05:57] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
[2024-05-27 07:05:59] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-27 07:05:59] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-27 07:05:59] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 1 ms to minimize.
[2024-05-27 07:05:59] [INFO ] Deduced a trap composed of 102 places in 76 ms of which 1 ms to minimize.
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 7/348 constraints. Problems are: Problem set: 44 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 0/348 constraints. Problems are: Problem set: 44 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 0/519 variables, 0/348 constraints. Problems are: Problem set: 44 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 348 constraints, problems are : Problem set: 44 solved, 280 unsolved in 18892 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 44 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 2/2 constraints. Problems are: Problem set: 44 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/2 constraints. Problems are: Problem set: 44 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 25/178 variables, 2/4 constraints. Problems are: Problem set: 44 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 44 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 16/194 variables, 1/5 constraints. Problems are: Problem set: 44 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 5/10 constraints. Problems are: Problem set: 44 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/10 constraints. Problems are: Problem set: 44 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 325/519 variables, 194/204 constraints. Problems are: Problem set: 44 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 144/348 constraints. Problems are: Problem set: 44 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/519 variables, 280/628 constraints. Problems are: Problem set: 44 solved, 280 unsolved
[2024-05-27 07:06:25] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2024-05-27 07:06:25] [INFO ] Deduced a trap composed of 100 places in 68 ms of which 2 ms to minimize.
Problem TDEAD268 is UNSAT
[2024-05-27 07:06:26] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 1 ms to minimize.
Problem TDEAD272 is UNSAT
[2024-05-27 07:06:26] [INFO ] Deduced a trap composed of 100 places in 68 ms of which 1 ms to minimize.
[2024-05-27 07:06:26] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 1 ms to minimize.
[2024-05-27 07:06:26] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 1 ms to minimize.
[2024-05-27 07:06:27] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/519 variables, 7/635 constraints. Problems are: Problem set: 46 solved, 278 unsolved
[2024-05-27 07:06:34] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/519 variables, 1/636 constraints. Problems are: Problem set: 46 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 636 constraints, problems are : Problem set: 46 solved, 278 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 280/324 constraints, Known Traps: 15/15 constraints]
After SMT, in 49501ms problems are : Problem set: 46 solved, 278 unsolved
Search for dead transitions found 46 dead transitions in 49505ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 194/341 places, 279/1312 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 152 transition count 261
Applied a total of 60 rules in 2 ms. Remains 152 /194 variables (removed 42) and now considering 261/279 (removed 18) transitions.
// Phase 1: matrix 261 rows 152 cols
[2024-05-27 07:06:40] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:06:40] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-27 07:06:40] [INFO ] Invariant cache hit.
[2024-05-27 07:06:40] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-05-27 07:06:40] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/341 places, 261/1312 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50895 ms. Remains : 152/341 places, 261/1312 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 288 ms.
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Computed a total of 15 stabilizing places and 77 stable transitions
Graph (complete) has 572 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 15 stabilizing places and 77 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-08 finished in 51574 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)||F(p1)))'
Support contains 3 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 1312/1312 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 316 transition count 575
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 316 transition count 575
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 316 transition count 573
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 113 place count 255 transition count 512
Iterating global reduction 1 with 61 rules applied. Total rules applied 174 place count 255 transition count 512
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 240 place count 255 transition count 446
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 308 place count 187 transition count 378
Iterating global reduction 2 with 68 rules applied. Total rules applied 376 place count 187 transition count 378
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 456 place count 187 transition count 298
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 458 place count 185 transition count 272
Iterating global reduction 3 with 2 rules applied. Total rules applied 460 place count 185 transition count 272
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 461 place count 184 transition count 271
Iterating global reduction 3 with 1 rules applied. Total rules applied 462 place count 184 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 463 place count 184 transition count 270
Applied a total of 463 rules in 57 ms. Remains 184 /341 variables (removed 157) and now considering 270/1312 (removed 1042) transitions.
// Phase 1: matrix 270 rows 184 cols
[2024-05-27 07:06:41] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 07:06:42] [INFO ] Implicit Places using invariants in 875 ms returned []
[2024-05-27 07:06:42] [INFO ] Invariant cache hit.
[2024-05-27 07:06:42] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 07:06:42] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
[2024-05-27 07:06:42] [INFO ] Redundant transitions in 1 ms returned []
Running 269 sub problems to find dead transitions.
[2024-05-27 07:06:42] [INFO ] Invariant cache hit.
[2024-05-27 07:06:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 4 (OVERLAPS) 270/454 variables, 184/187 constraints. Problems are: Problem set: 24 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 96/283 constraints. Problems are: Problem set: 24 solved, 245 unsolved
[2024-05-27 07:06:49] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2024-05-27 07:06:49] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 2/285 constraints. Problems are: Problem set: 24 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 0/285 constraints. Problems are: Problem set: 24 solved, 245 unsolved
[2024-05-27 07:06:54] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-05-27 07:06:55] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 1 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/454 variables, 2/287 constraints. Problems are: Problem set: 30 solved, 239 unsolved
[2024-05-27 07:06:58] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD91 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/288 constraints. Problems are: Problem set: 35 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/288 constraints. Problems are: Problem set: 35 solved, 234 unsolved
At refinement iteration 11 (OVERLAPS) 0/454 variables, 0/288 constraints. Problems are: Problem set: 35 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 288 constraints, problems are : Problem set: 35 solved, 234 unsolved in 21656 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 35 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 35 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 22/172 variables, 2/2 constraints. Problems are: Problem set: 35 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/4 constraints. Problems are: Problem set: 35 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/4 constraints. Problems are: Problem set: 35 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 12/184 variables, 1/5 constraints. Problems are: Problem set: 35 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 3/8 constraints. Problems are: Problem set: 35 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/8 constraints. Problems are: Problem set: 35 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 270/454 variables, 184/192 constraints. Problems are: Problem set: 35 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 96/288 constraints. Problems are: Problem set: 35 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 234/522 constraints. Problems are: Problem set: 35 solved, 234 unsolved
[2024-05-27 07:07:12] [INFO ] Deduced a trap composed of 106 places in 67 ms of which 2 ms to minimize.
[2024-05-27 07:07:12] [INFO ] Deduced a trap composed of 98 places in 71 ms of which 1 ms to minimize.
[2024-05-27 07:07:12] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-27 07:07:13] [INFO ] Deduced a trap composed of 100 places in 64 ms of which 2 ms to minimize.
[2024-05-27 07:07:13] [INFO ] Deduced a trap composed of 99 places in 71 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
[2024-05-27 07:07:16] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 1 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
[2024-05-27 07:07:16] [INFO ] Deduced a trap composed of 107 places in 66 ms of which 1 ms to minimize.
[2024-05-27 07:07:16] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2024-05-27 07:07:17] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 9/531 constraints. Problems are: Problem set: 46 solved, 223 unsolved
[2024-05-27 07:07:21] [INFO ] Deduced a trap composed of 106 places in 73 ms of which 1 ms to minimize.
[2024-05-27 07:07:22] [INFO ] Deduced a trap composed of 99 places in 65 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 2/533 constraints. Problems are: Problem set: 46 solved, 223 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/533 constraints. Problems are: Problem set: 46 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 533 constraints, problems are : Problem set: 46 solved, 223 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 234/269 constraints, Known Traps: 16/16 constraints]
After SMT, in 52276ms problems are : Problem set: 46 solved, 223 unsolved
Search for dead transitions found 46 dead transitions in 52280ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 184/341 places, 224/1312 transitions.
Graph (complete) has 553 edges and 184 vertex of which 142 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.3 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 142 transition count 206
Applied a total of 19 rules in 13 ms. Remains 142 /184 variables (removed 42) and now considering 206/224 (removed 18) transitions.
// Phase 1: matrix 206 rows 142 cols
[2024-05-27 07:07:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:07:35] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-27 07:07:35] [INFO ] Invariant cache hit.
[2024-05-27 07:07:35] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-27 07:07:35] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 142/341 places, 206/1312 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54087 ms. Remains : 142/341 places, 206/1312 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-09 finished in 54166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1||X((G(p0) U p2))))))'
Support contains 5 out of 341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 1312/1312 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 317 transition count 576
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 317 transition count 576
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 317 transition count 573
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 91 place count 277 transition count 533
Iterating global reduction 1 with 40 rules applied. Total rules applied 131 place count 277 transition count 533
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 165 place count 277 transition count 499
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 250 place count 192 transition count 414
Iterating global reduction 2 with 85 rules applied. Total rules applied 335 place count 192 transition count 414
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 435 place count 192 transition count 314
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 437 place count 190 transition count 284
Iterating global reduction 3 with 2 rules applied. Total rules applied 439 place count 190 transition count 284
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 440 place count 189 transition count 283
Iterating global reduction 3 with 1 rules applied. Total rules applied 441 place count 189 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 442 place count 189 transition count 282
Applied a total of 442 rules in 19 ms. Remains 189 /341 variables (removed 152) and now considering 282/1312 (removed 1030) transitions.
// Phase 1: matrix 282 rows 189 cols
[2024-05-27 07:07:35] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 07:07:35] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-27 07:07:35] [INFO ] Invariant cache hit.
[2024-05-27 07:07:35] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-27 07:07:36] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-05-27 07:07:36] [INFO ] Invariant cache hit.
[2024-05-27 07:07:36] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 4 (OVERLAPS) 282/471 variables, 189/192 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 104/296 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/296 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/296 constraints. Problems are: Problem set: 24 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 296 constraints, problems are : Problem set: 24 solved, 257 unsolved in 9862 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/1 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 24/189 variables, 2/3 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 282/471 variables, 189/192 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 104/296 constraints. Problems are: Problem set: 24 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 257/553 constraints. Problems are: Problem set: 24 solved, 257 unsolved
[2024-05-27 07:07:54] [INFO ] Deduced a trap composed of 100 places in 64 ms of which 2 ms to minimize.
[2024-05-27 07:07:54] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-05-27 07:07:55] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
[2024-05-27 07:07:55] [INFO ] Deduced a trap composed of 109 places in 65 ms of which 1 ms to minimize.
[2024-05-27 07:07:55] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 2 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
[2024-05-27 07:07:58] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
[2024-05-27 07:07:58] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
[2024-05-27 07:07:58] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
Problem TDEAD229 is UNSAT
[2024-05-27 07:07:58] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 1 ms to minimize.
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
[2024-05-27 07:07:59] [INFO ] Deduced a trap composed of 101 places in 56 ms of which 1 ms to minimize.
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
[2024-05-27 07:07:59] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
[2024-05-27 07:07:59] [INFO ] Deduced a trap composed of 93 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 12/565 constraints. Problems are: Problem set: 46 solved, 235 unsolved
[2024-05-27 07:08:04] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 1 ms to minimize.
[2024-05-27 07:08:04] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 2/567 constraints. Problems are: Problem set: 46 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 567 constraints, problems are : Problem set: 46 solved, 235 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 257/281 constraints, Known Traps: 14/14 constraints]
After SMT, in 40426ms problems are : Problem set: 46 solved, 235 unsolved
Search for dead transitions found 46 dead transitions in 40430ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/341 places, 236/1312 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 147 transition count 218
Applied a total of 60 rules in 1 ms. Remains 147 /189 variables (removed 42) and now considering 218/236 (removed 18) transitions.
// Phase 1: matrix 218 rows 147 cols
[2024-05-27 07:08:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:08:16] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 07:08:16] [INFO ] Invariant cache hit.
[2024-05-27 07:08:16] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 07:08:17] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/341 places, 218/1312 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41496 ms. Remains : 147/341 places, 218/1312 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-10 finished in 41674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 1312/1312 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 315 transition count 578
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 315 transition count 578
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 315 transition count 573
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 118 place count 254 transition count 512
Iterating global reduction 1 with 61 rules applied. Total rules applied 179 place count 254 transition count 512
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 247 place count 254 transition count 444
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 315 place count 186 transition count 376
Iterating global reduction 2 with 68 rules applied. Total rules applied 383 place count 186 transition count 376
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 463 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 465 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 467 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 468 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 469 place count 183 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 470 place count 183 transition count 268
Applied a total of 470 rules in 31 ms. Remains 183 /341 variables (removed 158) and now considering 268/1312 (removed 1044) transitions.
// Phase 1: matrix 268 rows 183 cols
[2024-05-27 07:08:17] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 07:08:17] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-27 07:08:17] [INFO ] Invariant cache hit.
[2024-05-27 07:08:17] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-27 07:08:18] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2024-05-27 07:08:18] [INFO ] Redundant transitions in 1 ms returned []
Running 267 sub problems to find dead transitions.
[2024-05-27 07:08:18] [INFO ] Invariant cache hit.
[2024-05-27 07:08:18] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 4 (OVERLAPS) 268/451 variables, 183/186 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 95/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
[2024-05-27 07:08:22] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-27 07:08:22] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-27 07:08:22] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 1 ms to minimize.
[2024-05-27 07:08:22] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-05-27 07:08:23] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-27 07:08:23] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
[2024-05-27 07:08:24] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-27 07:08:24] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 8/289 constraints. Problems are: Problem set: 44 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/289 constraints. Problems are: Problem set: 44 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 0/451 variables, 0/289 constraints. Problems are: Problem set: 44 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 289 constraints, problems are : Problem set: 44 solved, 223 unsolved in 13042 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 44 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 2/2 constraints. Problems are: Problem set: 44 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 44 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 25/167 variables, 2/4 constraints. Problems are: Problem set: 44 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/4 constraints. Problems are: Problem set: 44 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 16/183 variables, 1/5 constraints. Problems are: Problem set: 44 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 6/11 constraints. Problems are: Problem set: 44 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/11 constraints. Problems are: Problem set: 44 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 268/451 variables, 183/194 constraints. Problems are: Problem set: 44 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 95/289 constraints. Problems are: Problem set: 44 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 223/512 constraints. Problems are: Problem set: 44 solved, 223 unsolved
[2024-05-27 07:08:38] [INFO ] Deduced a trap composed of 109 places in 77 ms of which 1 ms to minimize.
[2024-05-27 07:08:38] [INFO ] Deduced a trap composed of 93 places in 67 ms of which 1 ms to minimize.
[2024-05-27 07:08:40] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-05-27 07:08:41] [INFO ] Deduced a trap composed of 91 places in 66 ms of which 1 ms to minimize.
[2024-05-27 07:08:41] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 2 ms to minimize.
[2024-05-27 07:08:41] [INFO ] Deduced a trap composed of 94 places in 68 ms of which 2 ms to minimize.
Problem TDEAD211 is UNSAT
[2024-05-27 07:08:41] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
Problem TDEAD215 is UNSAT
[2024-05-27 07:08:41] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 1 ms to minimize.
[2024-05-27 07:08:42] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 1 ms to minimize.
[2024-05-27 07:08:42] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 10/522 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/522 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 0/451 variables, 0/522 constraints. Problems are: Problem set: 46 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 522 constraints, problems are : Problem set: 46 solved, 221 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 223/267 constraints, Known Traps: 18/18 constraints]
After SMT, in 43498ms problems are : Problem set: 46 solved, 221 unsolved
Search for dead transitions found 46 dead transitions in 43501ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 183/341 places, 222/1312 transitions.
Graph (complete) has 549 edges and 183 vertex of which 141 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 141 transition count 204
Applied a total of 19 rules in 9 ms. Remains 141 /183 variables (removed 42) and now considering 204/222 (removed 18) transitions.
// Phase 1: matrix 204 rows 141 cols
[2024-05-27 07:09:01] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:09:01] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 07:09:01] [INFO ] Invariant cache hit.
[2024-05-27 07:09:01] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-27 07:09:01] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 141/341 places, 204/1312 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44541 ms. Remains : 141/341 places, 204/1312 transitions.
Stuttering acceptance computed with spot in 84 ms :[p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-11
Product exploration explored 100000 steps with 20581 reset in 164 ms.
Product exploration explored 100000 steps with 20564 reset in 219 ms.
Computed a total of 4 stabilizing places and 24 stable transitions
Graph (complete) has 497 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[p0]
RANDOM walk for 4231 steps (883 resets) in 15 ms. (264 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[p0]
Stuttering acceptance computed with spot in 28 ms :[p0]
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 204/204 transitions.
Applied a total of 0 rules in 6 ms. Remains 141 /141 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-27 07:09:02] [INFO ] Invariant cache hit.
[2024-05-27 07:09:02] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-27 07:09:02] [INFO ] Invariant cache hit.
[2024-05-27 07:09:02] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-27 07:09:03] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-27 07:09:03] [INFO ] Redundant transitions in 0 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-27 07:09:03] [INFO ] Invariant cache hit.
[2024-05-27 07:09:03] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/345 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 87/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/345 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 230 constraints, problems are : Problem set: 0 solved, 203 unsolved in 6867 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/345 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 87/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 203/433 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-27 07:09:14] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:09:16] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 0 ms to minimize.
[2024-05-27 07:09:16] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:09:16] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/345 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 437 constraints, problems are : Problem set: 0 solved, 203 unsolved in 19051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 4/4 constraints]
After SMT, in 26214ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 26217ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26549 ms. Remains : 141/141 places, 204/204 transitions.
Computed a total of 4 stabilizing places and 24 stable transitions
Graph (complete) has 497 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
RANDOM walk for 5304 steps (1119 resets) in 16 ms. (312 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Stuttering acceptance computed with spot in 26 ms :[p0]
Product exploration explored 100000 steps with 20488 reset in 168 ms.
Product exploration explored 100000 steps with 20622 reset in 178 ms.
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 141 /141 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-27 07:09:30] [INFO ] Invariant cache hit.
[2024-05-27 07:09:30] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-27 07:09:30] [INFO ] Invariant cache hit.
[2024-05-27 07:09:30] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-27 07:09:30] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-27 07:09:30] [INFO ] Redundant transitions in 0 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-27 07:09:30] [INFO ] Invariant cache hit.
[2024-05-27 07:09:30] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/345 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 87/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/345 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 230 constraints, problems are : Problem set: 0 solved, 203 unsolved in 6865 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/345 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 87/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 203/433 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-27 07:09:41] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:09:43] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:09:44] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-05-27 07:09:44] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/345 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 437 constraints, problems are : Problem set: 0 solved, 203 unsolved in 19172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 4/4 constraints]
After SMT, in 26304ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 26306ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26638 ms. Remains : 141/141 places, 204/204 transitions.
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-11 finished in 99440 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(((F((!p1||X(p2))) U p3)&&p0)))'
Support contains 4 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 1312/1312 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 316 transition count 619
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 316 transition count 619
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 316 transition count 614
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 115 place count 256 transition count 554
Iterating global reduction 1 with 60 rules applied. Total rules applied 175 place count 256 transition count 554
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 255 place count 256 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 319 place count 192 transition count 410
Iterating global reduction 2 with 64 rules applied. Total rules applied 383 place count 192 transition count 410
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 471 place count 192 transition count 322
Applied a total of 471 rules in 31 ms. Remains 192 /341 variables (removed 149) and now considering 322/1312 (removed 990) transitions.
// Phase 1: matrix 322 rows 192 cols
[2024-05-27 07:09:56] [INFO ] Computed 3 invariants in 6 ms
[2024-05-27 07:09:56] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-27 07:09:56] [INFO ] Invariant cache hit.
[2024-05-27 07:09:57] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-27 07:09:57] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2024-05-27 07:09:57] [INFO ] Redundant transitions in 1 ms returned []
Running 321 sub problems to find dead transitions.
[2024-05-27 07:09:57] [INFO ] Invariant cache hit.
[2024-05-27 07:09:57] [INFO ] State equation strengthened by 143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
At refinement iteration 4 (OVERLAPS) 322/514 variables, 192/195 constraints. Problems are: Problem set: 24 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 143/338 constraints. Problems are: Problem set: 24 solved, 297 unsolved
[2024-05-27 07:10:05] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 2 ms to minimize.
[2024-05-27 07:10:05] [INFO ] Deduced a trap composed of 111 places in 97 ms of which 1 ms to minimize.
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD113 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 2/340 constraints. Problems are: Problem set: 29 solved, 292 unsolved
[2024-05-27 07:10:09] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 1/341 constraints. Problems are: Problem set: 29 solved, 292 unsolved
[2024-05-27 07:10:12] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 1/342 constraints. Problems are: Problem set: 29 solved, 292 unsolved
[2024-05-27 07:10:15] [INFO ] Deduced a trap composed of 94 places in 63 ms of which 2 ms to minimize.
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 1/343 constraints. Problems are: Problem set: 34 solved, 287 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/343 constraints. Problems are: Problem set: 34 solved, 287 unsolved
At refinement iteration 11 (OVERLAPS) 0/514 variables, 0/343 constraints. Problems are: Problem set: 34 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 343 constraints, problems are : Problem set: 34 solved, 287 unsolved in 25298 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 34 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 34 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 21/180 variables, 2/2 constraints. Problems are: Problem set: 34 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 2/4 constraints. Problems are: Problem set: 34 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/4 constraints. Problems are: Problem set: 34 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 12/192 variables, 1/5 constraints. Problems are: Problem set: 34 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 3/8 constraints. Problems are: Problem set: 34 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/8 constraints. Problems are: Problem set: 34 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 322/514 variables, 192/200 constraints. Problems are: Problem set: 34 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 143/343 constraints. Problems are: Problem set: 34 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 287/630 constraints. Problems are: Problem set: 34 solved, 287 unsolved
[2024-05-27 07:10:32] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 1 ms to minimize.
[2024-05-27 07:10:32] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 2 ms to minimize.
[2024-05-27 07:10:32] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 1 ms to minimize.
[2024-05-27 07:10:32] [INFO ] Deduced a trap composed of 101 places in 66 ms of which 2 ms to minimize.
[2024-05-27 07:10:32] [INFO ] Deduced a trap composed of 94 places in 62 ms of which 1 ms to minimize.
[2024-05-27 07:10:33] [INFO ] Deduced a trap composed of 121 places in 59 ms of which 1 ms to minimize.
[2024-05-27 07:10:34] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:10:34] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 2 ms to minimize.
[2024-05-27 07:10:35] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
[2024-05-27 07:10:39] [INFO ] Deduced a trap composed of 102 places in 59 ms of which 2 ms to minimize.
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
[2024-05-27 07:10:40] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 1 ms to minimize.
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
[2024-05-27 07:10:40] [INFO ] Deduced a trap composed of 102 places in 65 ms of which 1 ms to minimize.
[2024-05-27 07:10:40] [INFO ] Deduced a trap composed of 89 places in 68 ms of which 2 ms to minimize.
[2024-05-27 07:10:41] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 14/644 constraints. Problems are: Problem set: 46 solved, 275 unsolved
[2024-05-27 07:10:51] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 645 constraints, problems are : Problem set: 46 solved, 275 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 287/321 constraints, Known Traps: 20/20 constraints]
After SMT, in 55923ms problems are : Problem set: 46 solved, 275 unsolved
Search for dead transitions found 46 dead transitions in 55926ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 192/341 places, 276/1312 transitions.
Graph (complete) has 617 edges and 192 vertex of which 150 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 150 transition count 258
Applied a total of 19 rules in 8 ms. Remains 150 /192 variables (removed 42) and now considering 258/276 (removed 18) transitions.
// Phase 1: matrix 258 rows 150 cols
[2024-05-27 07:10:53] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:10:53] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-27 07:10:53] [INFO ] Invariant cache hit.
[2024-05-27 07:10:53] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-27 07:10:53] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 150/341 places, 258/1312 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57119 ms. Remains : 150/341 places, 258/1312 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) (NOT p3)))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-12
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-12 finished in 57297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 1312/1312 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 314 transition count 533
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 314 transition count 533
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 314 transition count 530
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 119 place count 252 transition count 468
Iterating global reduction 1 with 62 rules applied. Total rules applied 181 place count 252 transition count 468
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 235 place count 252 transition count 414
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 307 place count 180 transition count 342
Iterating global reduction 2 with 72 rules applied. Total rules applied 379 place count 180 transition count 342
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 447 place count 180 transition count 274
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 449 place count 178 transition count 248
Iterating global reduction 3 with 2 rules applied. Total rules applied 451 place count 178 transition count 248
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 452 place count 177 transition count 247
Iterating global reduction 3 with 1 rules applied. Total rules applied 453 place count 177 transition count 247
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 457 place count 173 transition count 243
Iterating global reduction 3 with 4 rules applied. Total rules applied 461 place count 173 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 469 place count 173 transition count 235
Applied a total of 469 rules in 16 ms. Remains 173 /341 variables (removed 168) and now considering 235/1312 (removed 1077) transitions.
// Phase 1: matrix 235 rows 173 cols
[2024-05-27 07:10:54] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 07:10:54] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-27 07:10:54] [INFO ] Invariant cache hit.
[2024-05-27 07:10:54] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 07:10:54] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-27 07:10:54] [INFO ] Invariant cache hit.
[2024-05-27 07:10:54] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
At refinement iteration 5 (OVERLAPS) 235/408 variables, 173/176 constraints. Problems are: Problem set: 24 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 71/247 constraints. Problems are: Problem set: 24 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/247 constraints. Problems are: Problem set: 24 solved, 210 unsolved
[2024-05-27 07:11:01] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-05-27 07:11:01] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
[2024-05-27 07:11:01] [INFO ] Deduced a trap composed of 115 places in 56 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/408 variables, 3/250 constraints. Problems are: Problem set: 44 solved, 190 unsolved
[2024-05-27 07:11:04] [INFO ] Deduced a trap composed of 116 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 1/251 constraints. Problems are: Problem set: 44 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/251 constraints. Problems are: Problem set: 44 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 0/408 variables, 0/251 constraints. Problems are: Problem set: 44 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 251 constraints, problems are : Problem set: 44 solved, 190 unsolved in 15431 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 173/173 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 44 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 44 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 44 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 40/173 variables, 2/3 constraints. Problems are: Problem set: 44 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 4/7 constraints. Problems are: Problem set: 44 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/7 constraints. Problems are: Problem set: 44 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 235/408 variables, 173/180 constraints. Problems are: Problem set: 44 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 71/251 constraints. Problems are: Problem set: 44 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 190/441 constraints. Problems are: Problem set: 44 solved, 190 unsolved
[2024-05-27 07:11:15] [INFO ] Deduced a trap composed of 94 places in 58 ms of which 1 ms to minimize.
[2024-05-27 07:11:16] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 2 ms to minimize.
[2024-05-27 07:11:18] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 2 ms to minimize.
Problem TDEAD178 is UNSAT
[2024-05-27 07:11:18] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
Problem TDEAD182 is UNSAT
[2024-05-27 07:11:18] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 1 ms to minimize.
[2024-05-27 07:11:18] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 1 ms to minimize.
[2024-05-27 07:11:18] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 2 ms to minimize.
[2024-05-27 07:11:19] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 8/449 constraints. Problems are: Problem set: 46 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/449 constraints. Problems are: Problem set: 46 solved, 188 unsolved
[2024-05-27 07:11:30] [INFO ] Deduced a trap composed of 90 places in 51 ms of which 1 ms to minimize.
[2024-05-27 07:11:31] [INFO ] Deduced a trap composed of 101 places in 72 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/408 variables, 2/451 constraints. Problems are: Problem set: 46 solved, 188 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/451 constraints. Problems are: Problem set: 46 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/408 variables, and 451 constraints, problems are : Problem set: 46 solved, 188 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 173/173 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 190/234 constraints, Known Traps: 14/14 constraints]
After SMT, in 45838ms problems are : Problem set: 46 solved, 188 unsolved
Search for dead transitions found 46 dead transitions in 45840ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/341 places, 189/1312 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 131 transition count 171
Applied a total of 60 rules in 1 ms. Remains 131 /173 variables (removed 42) and now considering 171/189 (removed 18) transitions.
// Phase 1: matrix 171 rows 131 cols
[2024-05-27 07:11:40] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:11:40] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 07:11:40] [INFO ] Invariant cache hit.
[2024-05-27 07:11:40] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-27 07:11:40] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 131/341 places, 171/1312 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46759 ms. Remains : 131/341 places, 171/1312 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-14
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-14 finished in 46860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G(!p1)))))'
Support contains 4 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 1312/1312 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 317 transition count 664
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 317 transition count 664
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 317 transition count 657
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 114 place count 258 transition count 598
Iterating global reduction 1 with 59 rules applied. Total rules applied 173 place count 258 transition count 598
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 267 place count 258 transition count 504
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 327 place count 198 transition count 444
Iterating global reduction 2 with 60 rules applied. Total rules applied 387 place count 198 transition count 444
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 483 place count 198 transition count 348
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 484 place count 197 transition count 335
Iterating global reduction 3 with 1 rules applied. Total rules applied 485 place count 197 transition count 335
Applied a total of 485 rules in 32 ms. Remains 197 /341 variables (removed 144) and now considering 335/1312 (removed 977) transitions.
// Phase 1: matrix 335 rows 197 cols
[2024-05-27 07:11:40] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 07:11:41] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-27 07:11:41] [INFO ] Invariant cache hit.
[2024-05-27 07:11:41] [INFO ] State equation strengthened by 151 read => feed constraints.
[2024-05-27 07:11:41] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2024-05-27 07:11:41] [INFO ] Redundant transitions in 3 ms returned []
Running 334 sub problems to find dead transitions.
[2024-05-27 07:11:41] [INFO ] Invariant cache hit.
[2024-05-27 07:11:41] [INFO ] State equation strengthened by 151 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
At refinement iteration 4 (OVERLAPS) 335/532 variables, 197/200 constraints. Problems are: Problem set: 24 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 151/351 constraints. Problems are: Problem set: 24 solved, 310 unsolved
[2024-05-27 07:11:48] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-27 07:11:48] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
[2024-05-27 07:11:50] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-27 07:11:50] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2024-05-27 07:11:50] [INFO ] Deduced a trap composed of 96 places in 62 ms of which 1 ms to minimize.
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 5/356 constraints. Problems are: Problem set: 44 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/356 constraints. Problems are: Problem set: 44 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/356 constraints. Problems are: Problem set: 44 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 356 constraints, problems are : Problem set: 44 solved, 290 unsolved in 18489 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 197/197 constraints, ReadFeed: 151/151 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 44 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 2/2 constraints. Problems are: Problem set: 44 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/2 constraints. Problems are: Problem set: 44 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 25/181 variables, 2/4 constraints. Problems are: Problem set: 44 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/4 constraints. Problems are: Problem set: 44 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 16/197 variables, 1/5 constraints. Problems are: Problem set: 44 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 3/8 constraints. Problems are: Problem set: 44 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/8 constraints. Problems are: Problem set: 44 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 335/532 variables, 197/205 constraints. Problems are: Problem set: 44 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 151/356 constraints. Problems are: Problem set: 44 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 290/646 constraints. Problems are: Problem set: 44 solved, 290 unsolved
[2024-05-27 07:12:12] [INFO ] Deduced a trap composed of 116 places in 68 ms of which 1 ms to minimize.
[2024-05-27 07:12:12] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2024-05-27 07:12:15] [INFO ] Deduced a trap composed of 97 places in 69 ms of which 1 ms to minimize.
[2024-05-27 07:12:19] [INFO ] Deduced a trap composed of 92 places in 65 ms of which 2 ms to minimize.
[2024-05-27 07:12:20] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
Problem TDEAD278 is UNSAT
[2024-05-27 07:12:20] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
Problem TDEAD282 is UNSAT
[2024-05-27 07:12:20] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 1 ms to minimize.
[2024-05-27 07:12:20] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2024-05-27 07:12:21] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2024-05-27 07:12:21] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
[2024-05-27 07:12:21] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 11/657 constraints. Problems are: Problem set: 46 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 657 constraints, problems are : Problem set: 46 solved, 288 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 197/197 constraints, ReadFeed: 151/151 constraints, PredecessorRefiner: 290/334 constraints, Known Traps: 16/16 constraints]
After SMT, in 49194ms problems are : Problem set: 46 solved, 288 unsolved
Search for dead transitions found 46 dead transitions in 49198ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 197/341 places, 289/1312 transitions.
Graph (complete) has 641 edges and 197 vertex of which 155 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 155 transition count 271
Applied a total of 19 rules in 7 ms. Remains 155 /197 variables (removed 42) and now considering 271/289 (removed 18) transitions.
// Phase 1: matrix 271 rows 155 cols
[2024-05-27 07:12:30] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:12:31] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-27 07:12:31] [INFO ] Invariant cache hit.
[2024-05-27 07:12:31] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-27 07:12:31] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 155/341 places, 271/1312 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50420 ms. Remains : 155/341 places, 271/1312 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-15
Product exploration explored 100000 steps with 18005 reset in 232 ms.
Product exploration explored 100000 steps with 17890 reset in 237 ms.
Computed a total of 12 stabilizing places and 70 stable transitions
Graph (complete) has 589 edges and 155 vertex of which 154 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) p1), p1]
RANDOM walk for 40000 steps (7172 resets) in 171 ms. (232 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1235 resets) in 263 ms. (151 steps per ms) remains 1/1 properties
[2024-05-27 07:12:32] [INFO ] Invariant cache hit.
[2024-05-27 07:12:32] [INFO ] State equation strengthened by 143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/263 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 426/426 variables, and 224 constraints, problems are : Problem set: 1 solved, 0 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 67/143 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 210 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[p1]
Stuttering acceptance computed with spot in 42 ms :[p1]
Support contains 2 out of 155 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 : 155/155 places, 271/271 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2024-05-27 07:12:32] [INFO ] Invariant cache hit.
[2024-05-27 07:12:32] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 07:12:32] [INFO ] Invariant cache hit.
[2024-05-27 07:12:32] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-27 07:12:33] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-05-27 07:12:33] [INFO ] Redundant transitions in 1 ms returned []
Running 270 sub problems to find dead transitions.
[2024-05-27 07:12:33] [INFO ] Invariant cache hit.
[2024-05-27 07:12:33] [INFO ] State equation strengthened by 143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/426 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 143/300 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/426 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 300 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10499 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/426 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 143/300 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 270/570 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-27 07:12:52] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:12:53] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:12:54] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
[2024-05-27 07:12:54] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 4/574 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-27 07:13:10] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/426 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 575 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 5/5 constraints]
After SMT, in 40907ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 40910ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41354 ms. Remains : 155/155 places, 271/271 transitions.
Computed a total of 12 stabilizing places and 70 stable transitions
Graph (complete) has 589 edges and 155 vertex of which 154 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 12 stabilizing places and 70 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p1]
RANDOM walk for 3784 steps (700 resets) in 21 ms. (172 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[p1]
Stuttering acceptance computed with spot in 35 ms :[p1]
Stuttering acceptance computed with spot in 47 ms :[p1]
Product exploration explored 100000 steps with 18103 reset in 222 ms.
Product exploration explored 100000 steps with 18110 reset in 228 ms.
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 271/271 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 153 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 153 transition count 237
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 151 transition count 235
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 151 transition count 235
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 16 place count 143 transition count 227
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 143 transition count 227
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 143 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 142 transition count 206
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 142 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 141 transition count 205
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 141 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 141 transition count 204
Applied a total of 37 rules in 13 ms. Remains 141 /155 variables (removed 14) and now considering 204/271 (removed 67) transitions.
// Phase 1: matrix 204 rows 141 cols
[2024-05-27 07:13:14] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:13:14] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 07:13:14] [INFO ] Invariant cache hit.
[2024-05-27 07:13:15] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-27 07:13:15] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-27 07:13:15] [INFO ] Redundant transitions in 1 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-27 07:13:15] [INFO ] Invariant cache hit.
[2024-05-27 07:13:15] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/345 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 87/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/345 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 230 constraints, problems are : Problem set: 0 solved, 203 unsolved in 6895 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/345 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 87/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 203/433 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-27 07:13:26] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:13:28] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:13:28] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 0 ms to minimize.
[2024-05-27 07:13:28] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/345 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 437 constraints, problems are : Problem set: 0 solved, 203 unsolved in 19031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 4/4 constraints]
After SMT, in 26221ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 26223ms
Starting structural reductions in SI_LTL mode, iteration 1 : 141/155 places, 204/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26554 ms. Remains : 141/155 places, 204/271 transitions.
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-15 finished in 120544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G(!p1)))))'
[2024-05-27 07:13:41] [INFO ] Flatten gal took : 65 ms
[2024-05-27 07:13:41] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-27 07:13:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 341 places, 1312 transitions and 5217 arcs took 10 ms.
Total runtime 861654 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RingSingleMessageInMbox-PT-d1m005

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 341
TRANSITIONS: 1312
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.022s, Sys 0.005s]


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


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

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

Process ID: 2112
MODEL NAME: /home/mcc/execution/411/model
341 places, 1312 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716794041853

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is RingSingleMessageInMbox-PT-d1m005, 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 r333-tall-171679077600060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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