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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 247K Jun 2 16:33 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 FireWire-PT-20-LTLCardinality-00
FORMULA_NAME FireWire-PT-20-LTLCardinality-01
FORMULA_NAME FireWire-PT-20-LTLCardinality-02
FORMULA_NAME FireWire-PT-20-LTLCardinality-03
FORMULA_NAME FireWire-PT-20-LTLCardinality-04
FORMULA_NAME FireWire-PT-20-LTLCardinality-05
FORMULA_NAME FireWire-PT-20-LTLCardinality-06
FORMULA_NAME FireWire-PT-20-LTLCardinality-07
FORMULA_NAME FireWire-PT-20-LTLCardinality-08
FORMULA_NAME FireWire-PT-20-LTLCardinality-09
FORMULA_NAME FireWire-PT-20-LTLCardinality-10
FORMULA_NAME FireWire-PT-20-LTLCardinality-11
FORMULA_NAME FireWire-PT-20-LTLCardinality-12
FORMULA_NAME FireWire-PT-20-LTLCardinality-13
FORMULA_NAME FireWire-PT-20-LTLCardinality-14
FORMULA_NAME FireWire-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717358199188

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:56:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:56:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:56:40] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-06-02 19:56:40] [INFO ] Transformed 626 places.
[2024-06-02 19:56:40] [INFO ] Transformed 1031 transitions.
[2024-06-02 19:56:40] [INFO ] Found NUPN structural information;
[2024-06-02 19:56:40] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA FireWire-PT-20-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 611 transition count 1031
Discarding 136 places :
Symmetric choice reduction at 1 with 136 rule applications. Total rules 151 place count 475 transition count 895
Iterating global reduction 1 with 136 rules applied. Total rules applied 287 place count 475 transition count 895
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 288 place count 475 transition count 894
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 322 place count 441 transition count 756
Iterating global reduction 2 with 34 rules applied. Total rules applied 356 place count 441 transition count 756
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 357 place count 441 transition count 755
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 366 place count 432 transition count 743
Iterating global reduction 3 with 9 rules applied. Total rules applied 375 place count 432 transition count 743
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 378 place count 432 transition count 740
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 380 place count 430 transition count 734
Iterating global reduction 4 with 2 rules applied. Total rules applied 382 place count 430 transition count 734
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 384 place count 428 transition count 730
Iterating global reduction 4 with 2 rules applied. Total rules applied 386 place count 428 transition count 730
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 388 place count 426 transition count 724
Iterating global reduction 4 with 2 rules applied. Total rules applied 390 place count 426 transition count 724
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 392 place count 424 transition count 720
Iterating global reduction 4 with 2 rules applied. Total rules applied 394 place count 424 transition count 720
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 395 place count 423 transition count 717
Iterating global reduction 4 with 1 rules applied. Total rules applied 396 place count 423 transition count 717
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 397 place count 422 transition count 715
Iterating global reduction 4 with 1 rules applied. Total rules applied 398 place count 422 transition count 715
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 399 place count 421 transition count 712
Iterating global reduction 4 with 1 rules applied. Total rules applied 400 place count 421 transition count 712
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 401 place count 420 transition count 710
Iterating global reduction 4 with 1 rules applied. Total rules applied 402 place count 420 transition count 710
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 403 place count 419 transition count 707
Iterating global reduction 4 with 1 rules applied. Total rules applied 404 place count 419 transition count 707
Applied a total of 404 rules in 194 ms. Remains 419 /626 variables (removed 207) and now considering 707/1031 (removed 324) transitions.
// Phase 1: matrix 707 rows 419 cols
[2024-06-02 19:56:40] [INFO ] Computed 10 invariants in 25 ms
[2024-06-02 19:56:41] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-06-02 19:56:41] [INFO ] Invariant cache hit.
[2024-06-02 19:56:41] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Running 706 sub problems to find dead transitions.
[2024-06-02 19:56:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-06-02 19:56:50] [INFO ] Deduced a trap composed of 248 places in 175 ms of which 23 ms to minimize.
[2024-06-02 19:56:50] [INFO ] Deduced a trap composed of 256 places in 167 ms of which 3 ms to minimize.
[2024-06-02 19:56:51] [INFO ] Deduced a trap composed of 247 places in 138 ms of which 3 ms to minimize.
[2024-06-02 19:56:51] [INFO ] Deduced a trap composed of 246 places in 129 ms of which 2 ms to minimize.
[2024-06-02 19:56:51] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 3 ms to minimize.
[2024-06-02 19:56:51] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:56:51] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:56:51] [INFO ] Deduced a trap composed of 99 places in 70 ms of which 2 ms to minimize.
[2024-06-02 19:56:51] [INFO ] Deduced a trap composed of 240 places in 129 ms of which 2 ms to minimize.
[2024-06-02 19:56:51] [INFO ] Deduced a trap composed of 249 places in 126 ms of which 3 ms to minimize.
[2024-06-02 19:56:52] [INFO ] Deduced a trap composed of 242 places in 153 ms of which 2 ms to minimize.
[2024-06-02 19:56:52] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:56:52] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-06-02 19:56:52] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:56:52] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 2 ms to minimize.
[2024-06-02 19:56:53] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 2 ms to minimize.
[2024-06-02 19:56:53] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:56:53] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:56:54] [INFO ] Deduced a trap composed of 246 places in 134 ms of which 3 ms to minimize.
[2024-06-02 19:56:54] [INFO ] Deduced a trap composed of 236 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-06-02 19:56:54] [INFO ] Deduced a trap composed of 237 places in 136 ms of which 2 ms to minimize.
[2024-06-02 19:56:55] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:56:55] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 2 ms to minimize.
[2024-06-02 19:56:56] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:56:57] [INFO ] Deduced a trap composed of 92 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:56:59] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 3 ms to minimize.
[2024-06-02 19:57:01] [INFO ] Deduced a trap composed of 110 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-06-02 19:57:06] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1126 variables, and 38 constraints, problems are : Problem set: 0 solved, 706 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/419 constraints, PredecessorRefiner: 706/706 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 706 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-06-02 19:57:16] [INFO ] Deduced a trap composed of 247 places in 126 ms of which 2 ms to minimize.
[2024-06-02 19:57:17] [INFO ] Deduced a trap composed of 110 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-06-02 19:57:23] [INFO ] Deduced a trap composed of 242 places in 125 ms of which 2 ms to minimize.
[2024-06-02 19:57:23] [INFO ] Deduced a trap composed of 238 places in 132 ms of which 2 ms to minimize.
[2024-06-02 19:57:26] [INFO ] Deduced a trap composed of 239 places in 129 ms of which 3 ms to minimize.
[2024-06-02 19:57:27] [INFO ] Deduced a trap composed of 126 places in 133 ms of which 2 ms to minimize.
[2024-06-02 19:57:27] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-06-02 19:57:27] [INFO ] Deduced a trap composed of 243 places in 125 ms of which 2 ms to minimize.
[2024-06-02 19:57:27] [INFO ] Deduced a trap composed of 245 places in 124 ms of which 2 ms to minimize.
[2024-06-02 19:57:27] [INFO ] Deduced a trap composed of 242 places in 126 ms of which 2 ms to minimize.
[2024-06-02 19:57:27] [INFO ] Deduced a trap composed of 245 places in 124 ms of which 2 ms to minimize.
[2024-06-02 19:57:28] [INFO ] Deduced a trap composed of 241 places in 129 ms of which 2 ms to minimize.
[2024-06-02 19:57:28] [INFO ] Deduced a trap composed of 240 places in 119 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-06-02 19:57:34] [INFO ] Deduced a trap composed of 81 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-06-02 19:57:41] [INFO ] Deduced a trap composed of 242 places in 119 ms of which 2 ms to minimize.
[2024-06-02 19:57:42] [INFO ] Deduced a trap composed of 250 places in 118 ms of which 3 ms to minimize.
[2024-06-02 19:57:42] [INFO ] Deduced a trap composed of 254 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/1126 variables, and 55 constraints, problems are : Problem set: 0 solved, 706 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/419 constraints, PredecessorRefiner: 0/706 constraints, Known Traps: 45/45 constraints]
After SMT, in 60529ms problems are : Problem set: 0 solved, 706 unsolved
Search for dead transitions found 0 dead transitions in 60548ms
Starting structural reductions in LTL mode, iteration 1 : 419/626 places, 707/1031 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61598 ms. Remains : 419/626 places, 707/1031 transitions.
Support contains 32 out of 419 places after structural reductions.
[2024-06-02 19:57:42] [INFO ] Flatten gal took : 90 ms
[2024-06-02 19:57:42] [INFO ] Flatten gal took : 43 ms
[2024-06-02 19:57:42] [INFO ] Input system was already deterministic with 707 transitions.
Support contains 27 out of 419 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (32 resets) in 943 ms. (42 steps per ms) remains 9/14 properties
BEST_FIRST walk for 40000 steps (16 resets) in 544 ms. (73 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (23 resets) in 273 ms. (145 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (20 resets) in 193 ms. (206 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (28 resets) in 188 ms. (211 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (39 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (23 resets) in 172 ms. (231 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (31 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (15 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (17 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
[2024-06-02 19:57:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 330/346 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 38/384 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 673/1057 variables, 384/394 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1057 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 35/1092 variables, 18/412 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1092 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 23/1115 variables, 9/421 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1115 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 11/1126 variables, 8/429 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1126 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/1126 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1126/1126 variables, and 429 constraints, problems are : Problem set: 0 solved, 9 unsolved in 905 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 330/346 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:57:44] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:57:44] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 38/384 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:57:45] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 2 ms to minimize.
[2024-06-02 19:57:45] [INFO ] Deduced a trap composed of 111 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:57:45] [INFO ] Deduced a trap composed of 108 places in 60 ms of which 2 ms to minimize.
[2024-06-02 19:57:45] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 673/1057 variables, 384/400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1057 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1057 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 35/1092 variables, 18/426 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1092 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:57:46] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1092 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1092 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 23/1115 variables, 9/437 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1115 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 11/1126 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:57:46] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1126 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1126 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/1126 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1126/1126 variables, and 446 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2924 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 8/8 constraints]
After SMT, in 3845ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 3 properties in 9016 ms.
Support contains 10 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 707/707 transitions.
Graph (trivial) has 285 edges and 419 vertex of which 8 / 419 are part of one of the 2 SCC in 9 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 413 transition count 643
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 59 rules applied. Total rules applied 112 place count 361 transition count 636
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 115 place count 358 transition count 636
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 115 place count 358 transition count 597
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 193 place count 319 transition count 597
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 201 place count 311 transition count 586
Iterating global reduction 3 with 8 rules applied. Total rules applied 209 place count 311 transition count 586
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 209 place count 311 transition count 581
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 219 place count 306 transition count 581
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 224 place count 301 transition count 573
Iterating global reduction 3 with 5 rules applied. Total rules applied 229 place count 301 transition count 573
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 232 place count 298 transition count 566
Iterating global reduction 3 with 3 rules applied. Total rules applied 235 place count 298 transition count 566
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 237 place count 296 transition count 561
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 296 transition count 561
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 241 place count 294 transition count 556
Iterating global reduction 3 with 2 rules applied. Total rules applied 243 place count 294 transition count 556
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 245 place count 292 transition count 551
Iterating global reduction 3 with 2 rules applied. Total rules applied 247 place count 292 transition count 551
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 249 place count 290 transition count 547
Iterating global reduction 3 with 2 rules applied. Total rules applied 251 place count 290 transition count 547
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 253 place count 288 transition count 542
Iterating global reduction 3 with 2 rules applied. Total rules applied 255 place count 288 transition count 542
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 256 place count 287 transition count 540
Iterating global reduction 3 with 1 rules applied. Total rules applied 257 place count 287 transition count 540
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 258 place count 286 transition count 537
Iterating global reduction 3 with 1 rules applied. Total rules applied 259 place count 286 transition count 537
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 260 place count 285 transition count 535
Iterating global reduction 3 with 1 rules applied. Total rules applied 261 place count 285 transition count 535
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 262 place count 284 transition count 532
Iterating global reduction 3 with 1 rules applied. Total rules applied 263 place count 284 transition count 532
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 264 place count 283 transition count 530
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 283 transition count 530
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 282 transition count 528
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 282 transition count 528
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 281 transition count 526
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 281 transition count 526
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 333 place count 249 transition count 494
Performed 42 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 417 place count 207 transition count 584
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 422 place count 207 transition count 579
Free-agglomeration rule applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 445 place count 207 transition count 556
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 476 place count 184 transition count 548
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 482 place count 178 transition count 542
Iterating global reduction 4 with 6 rules applied. Total rules applied 488 place count 178 transition count 542
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 494 place count 178 transition count 536
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 519 place count 178 transition count 511
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 521 place count 178 transition count 511
Applied a total of 521 rules in 279 ms. Remains 178 /419 variables (removed 241) and now considering 511/707 (removed 196) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 178/419 places, 511/707 transitions.
RANDOM walk for 40000 steps (1304 resets) in 1060 ms. (37 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (253 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (247 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (246 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (237 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (253 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
[2024-06-02 19:57:57] [INFO ] Flow matrix only has 501 transitions (discarded 10 similar events)
// Phase 1: matrix 501 rows 178 cols
[2024-06-02 19:57:57] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 19:57:57] [INFO ] State equation strengthened by 89 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 125/133 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 33/166 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 501/667 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 89/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 12/679 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/679 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/679 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 679/679 variables, and 277 constraints, problems are : Problem set: 0 solved, 5 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 125/133 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:57:57] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 33/166 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 501/667 variables, 166/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 89/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 12/679 variables, 12/283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/679 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/679 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 679/679 variables, and 283 constraints, problems are : Problem set: 0 solved, 5 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 854ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 831 ms.
Support contains 8 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 511/511 transitions.
Graph (trivial) has 18 edges and 178 vertex of which 2 / 178 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 177 transition count 508
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 176 transition count 508
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 176 transition count 507
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 176 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 175 transition count 506
Applied a total of 6 rules in 40 ms. Remains 175 /178 variables (removed 3) and now considering 506/511 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 175/178 places, 506/511 transitions.
RANDOM walk for 40000 steps (1321 resets) in 245 ms. (162 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (255 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (256 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (262 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (264 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (264 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 997342 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :4 out of 5
Probabilistic random walk after 997342 steps, saw 257151 distinct states, run finished after 3004 ms. (steps per millisecond=332 ) properties seen :4
[2024-06-02 19:58:02] [INFO ] Flow matrix only has 496 transitions (discarded 10 similar events)
// Phase 1: matrix 496 rows 175 cols
[2024-06-02 19:58:02] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:58:02] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:58:02] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:58:02] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 495/657 variables, 162/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 88/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 14/671 variables, 13/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/671 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/671 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 495/657 variables, 162/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 88/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/671 variables, 13/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/671 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/671 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 671/671 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 539ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 506/506 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 172 transition count 503
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 172 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 171 transition count 502
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 170 transition count 505
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 170 transition count 499
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 170 transition count 499
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 170 transition count 498
Applied a total of 21 rules in 34 ms. Remains 170 /175 variables (removed 5) and now considering 498/506 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 170/175 places, 498/506 transitions.
RANDOM walk for 40000 steps (1298 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (268 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1077441 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :0 out of 1
Probabilistic random walk after 1077441 steps, saw 304889 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
[2024-06-02 19:58:06] [INFO ] Flow matrix only has 488 transitions (discarded 10 similar events)
// Phase 1: matrix 488 rows 170 cols
[2024-06-02 19:58:06] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 19:58:06] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/158 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:58:06] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 488/646 variables, 158/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 87/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/658 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/658 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/658 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/158 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:58:06] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 488/646 variables, 158/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 87/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/658 variables, 12/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/658 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/658 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 658/658 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 547ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 498/498 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 170/170 places, 498/498 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 498/498 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 498/498 (removed 0) transitions.
[2024-06-02 19:58:06] [INFO ] Flow matrix only has 488 transitions (discarded 10 similar events)
[2024-06-02 19:58:06] [INFO ] Invariant cache hit.
[2024-06-02 19:58:06] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 19:58:06] [INFO ] Flow matrix only has 488 transitions (discarded 10 similar events)
[2024-06-02 19:58:06] [INFO ] Invariant cache hit.
[2024-06-02 19:58:06] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-02 19:58:07] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-06-02 19:58:07] [INFO ] Redundant transitions in 34 ms returned []
Running 490 sub problems to find dead transitions.
[2024-06-02 19:58:07] [INFO ] Flow matrix only has 488 transitions (discarded 10 similar events)
[2024-06-02 19:58:07] [INFO ] Invariant cache hit.
[2024-06-02 19:58:07] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-06-02 19:58:10] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:58:10] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:58:11] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:58:11] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 3 ms to minimize.
[2024-06-02 19:58:11] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:58:11] [INFO ] Deduced a trap composed of 123 places in 76 ms of which 2 ms to minimize.
[2024-06-02 19:58:11] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 488/658 variables, 170/187 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 87/274 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-06-02 19:58:18] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 8 (OVERLAPS) 0/658 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 490 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 275 constraints, problems are : Problem set: 0 solved, 490 unsolved in 22109 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-06-02 19:58:31] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:58:31] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (OVERLAPS) 488/658 variables, 170/190 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 87/277 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 490/767 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 658/658 variables, and 767 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 10/10 constraints]
After SMT, in 52765ms problems are : Problem set: 0 solved, 490 unsolved
Search for dead transitions found 0 dead transitions in 52770ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53362 ms. Remains : 170/170 places, 498/498 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 110 edges and 170 vertex of which 30 / 170 are part of one of the 5 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 171 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 141 transition count 323
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 141 transition count 323
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 141 transition count 313
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 140 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 46 place count 140 transition count 287
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 51 place count 140 transition count 282
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 58 place count 135 transition count 280
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 58 place count 135 transition count 278
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 133 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 132 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 132 transition count 274
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 131 transition count 273
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 130 transition count 239
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 130 transition count 239
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 76 place count 130 transition count 234
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 82 place count 125 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 86 place count 125 transition count 229
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 125 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 123 transition count 227
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 96 place count 123 transition count 227
Applied a total of 96 rules in 55 ms. Remains 123 /170 variables (removed 47) and now considering 227/498 (removed 271) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:59:00] [INFO ] Flow matrix only has 223 transitions (discarded 4 similar events)
// Phase 1: matrix 223 rows 123 cols
[2024-06-02 19:59:00] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:59:00] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:59:00] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 19:59:00] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-02 19:59:00] [INFO ] After 12ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:59:00] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:59:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:59:00] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:59:00] [INFO ] After 8ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:59:00] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:59:00] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 294 ms.
FORMULA FireWire-PT-20-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FireWire-PT-20-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 118 stabilizing places and 177 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 419 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 419/419 places, 707/707 transitions.
Graph (trivial) has 294 edges and 419 vertex of which 11 / 419 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 410 transition count 644
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 357 transition count 637
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 354 transition count 637
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 117 place count 354 transition count 599
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 193 place count 316 transition count 599
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 203 place count 306 transition count 586
Iterating global reduction 3 with 10 rules applied. Total rules applied 213 place count 306 transition count 586
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 213 place count 306 transition count 581
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 223 place count 301 transition count 581
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 230 place count 294 transition count 570
Iterating global reduction 3 with 7 rules applied. Total rules applied 237 place count 294 transition count 570
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 240 place count 291 transition count 563
Iterating global reduction 3 with 3 rules applied. Total rules applied 243 place count 291 transition count 563
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 245 place count 289 transition count 558
Iterating global reduction 3 with 2 rules applied. Total rules applied 247 place count 289 transition count 558
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 249 place count 287 transition count 553
Iterating global reduction 3 with 2 rules applied. Total rules applied 251 place count 287 transition count 553
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 253 place count 285 transition count 548
Iterating global reduction 3 with 2 rules applied. Total rules applied 255 place count 285 transition count 548
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 257 place count 283 transition count 544
Iterating global reduction 3 with 2 rules applied. Total rules applied 259 place count 283 transition count 544
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 261 place count 281 transition count 539
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 281 transition count 539
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 264 place count 280 transition count 537
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 280 transition count 537
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 279 transition count 534
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 279 transition count 534
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 278 transition count 532
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 278 transition count 532
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 277 transition count 529
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 277 transition count 529
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 272 place count 276 transition count 527
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 276 transition count 527
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 274 place count 275 transition count 525
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 275 transition count 525
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 274 transition count 523
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 274 transition count 523
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 343 place count 241 transition count 490
Performed 44 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 431 place count 197 transition count 585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 432 place count 197 transition count 584
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 434 place count 197 transition count 582
Applied a total of 434 rules in 132 ms. Remains 197 /419 variables (removed 222) and now considering 582/707 (removed 125) transitions.
[2024-06-02 19:59:00] [INFO ] Flow matrix only has 553 transitions (discarded 29 similar events)
// Phase 1: matrix 553 rows 197 cols
[2024-06-02 19:59:00] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:59:00] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 19:59:00] [INFO ] Flow matrix only has 553 transitions (discarded 29 similar events)
[2024-06-02 19:59:00] [INFO ] Invariant cache hit.
[2024-06-02 19:59:00] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 19:59:01] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-06-02 19:59:01] [INFO ] Redundant transitions in 47 ms returned []
Running 573 sub problems to find dead transitions.
[2024-06-02 19:59:01] [INFO ] Flow matrix only has 553 transitions (discarded 29 similar events)
[2024-06-02 19:59:01] [INFO ] Invariant cache hit.
[2024-06-02 19:59:01] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-06-02 19:59:06] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-06-02 19:59:06] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:59:06] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:59:06] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:59:07] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:59:07] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:59:08] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:59:08] [INFO ] Deduced a trap composed of 141 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-06-02 19:59:12] [INFO ] Deduced a trap composed of 138 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-06-02 19:59:15] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 7 (OVERLAPS) 552/749 variables, 197/217 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/749 variables, 12/229 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/749 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 749/750 variables, and 229 constraints, problems are : Problem set: 0 solved, 573 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 573/573 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-06-02 19:59:35] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-06-02 19:59:38] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:59:38] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:59:38] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 8 (OVERLAPS) 552/749 variables, 197/221 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/749 variables, 12/233 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/749 variables, 573/806 constraints. Problems are: Problem set: 0 solved, 573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/750 variables, and 806 constraints, problems are : Problem set: 0 solved, 573 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 573/573 constraints, Known Traps: 14/14 constraints]
After SMT, in 60683ms problems are : Problem set: 0 solved, 573 unsolved
Search for dead transitions found 0 dead transitions in 60688ms
Starting structural reductions in SI_LTL mode, iteration 1 : 197/419 places, 582/707 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61398 ms. Remains : 197/419 places, 582/707 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-20-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-20-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLCardinality-00 finished in 61683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 419/419 places, 707/707 transitions.
Graph (trivial) has 292 edges and 419 vertex of which 11 / 419 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 410 transition count 644
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 357 transition count 637
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 354 transition count 637
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 117 place count 354 transition count 599
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 193 place count 316 transition count 599
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 204 place count 305 transition count 584
Iterating global reduction 3 with 11 rules applied. Total rules applied 215 place count 305 transition count 584
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 215 place count 305 transition count 579
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 225 place count 300 transition count 579
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 232 place count 293 transition count 568
Iterating global reduction 3 with 7 rules applied. Total rules applied 239 place count 293 transition count 568
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 242 place count 290 transition count 561
Iterating global reduction 3 with 3 rules applied. Total rules applied 245 place count 290 transition count 561
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 247 place count 288 transition count 556
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 288 transition count 556
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 251 place count 286 transition count 551
Iterating global reduction 3 with 2 rules applied. Total rules applied 253 place count 286 transition count 551
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 255 place count 284 transition count 546
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 284 transition count 546
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 259 place count 282 transition count 542
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 282 transition count 542
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 263 place count 280 transition count 537
Iterating global reduction 3 with 2 rules applied. Total rules applied 265 place count 280 transition count 537
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 279 transition count 535
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 279 transition count 535
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 278 transition count 532
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 278 transition count 532
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 277 transition count 530
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 277 transition count 530
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 272 place count 276 transition count 527
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 276 transition count 527
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 274 place count 275 transition count 525
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 275 transition count 525
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 274 transition count 523
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 274 transition count 523
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 278 place count 273 transition count 521
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 273 transition count 521
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 341 place count 242 transition count 490
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 429 place count 198 transition count 588
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 432 place count 198 transition count 585
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 434 place count 198 transition count 585
Applied a total of 434 rules in 101 ms. Remains 198 /419 variables (removed 221) and now considering 585/707 (removed 122) transitions.
[2024-06-02 20:00:02] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
// Phase 1: matrix 556 rows 198 cols
[2024-06-02 20:00:02] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 20:00:02] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 20:00:02] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 20:00:02] [INFO ] Invariant cache hit.
[2024-06-02 20:00:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-02 20:00:02] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-06-02 20:00:02] [INFO ] Redundant transitions in 5 ms returned []
Running 576 sub problems to find dead transitions.
[2024-06-02 20:00:02] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 20:00:02] [INFO ] Invariant cache hit.
[2024-06-02 20:00:02] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 20:00:07] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-06-02 20:00:07] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2024-06-02 20:00:08] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-02 20:00:08] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2024-06-02 20:00:09] [INFO ] Deduced a trap composed of 137 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 20:00:13] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-06-02 20:00:14] [INFO ] Deduced a trap composed of 136 places in 94 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 20:00:16] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-06-02 20:00:16] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (OVERLAPS) 555/753 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/753 variables, 10/227 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/754 variables, and 227 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (OVERLAPS) 1/198 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (OVERLAPS) 555/753 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 10/227 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/753 variables, 576/803 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 20:00:47] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 753/754 variables, and 804 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 10/10 constraints]
After SMT, in 60634ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 60641ms
Starting structural reductions in SI_LTL mode, iteration 1 : 198/419 places, 585/707 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61127 ms. Remains : 198/419 places, 585/707 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLCardinality-01
Product exploration explored 100000 steps with 2 reset in 135 ms.
Product exploration explored 100000 steps with 4 reset in 88 ms.
Computed a total of 33 stabilizing places and 58 stable transitions
Computed a total of 33 stabilizing places and 58 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1521 resets) in 462 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (260 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1172196 steps, run timeout after 3001 ms. (steps per millisecond=390 ) properties seen :0 out of 1
Probabilistic random walk after 1172196 steps, saw 246733 distinct states, run finished after 3001 ms. (steps per millisecond=390 ) properties seen :0
[2024-06-02 20:01:07] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 20:01:07] [INFO ] Invariant cache hit.
[2024-06-02 20:01:07] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/166 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 538/704 variables, 166/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/704 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 49/753 variables, 32/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/753 variables, 6/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/753 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/753 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 753/754 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/166 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:01:07] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 538/704 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/704 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/704 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/704 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/753 variables, 32/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/753 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/753 variables, 6/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/753 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/753 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 753/754 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 431ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 585/585 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 198 transition count 582
Free-agglomeration rule applied 22 times.
Iterating global reduction 1 with 22 rules applied. Total rules applied 25 place count 198 transition count 560
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 56 place count 176 transition count 551
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 170 transition count 545
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 170 transition count 545
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 77 place count 170 transition count 536
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 104 place count 170 transition count 509
Applied a total of 104 rules in 26 ms. Remains 170 /198 variables (removed 28) and now considering 509/585 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 170/198 places, 509/585 transitions.
RANDOM walk for 37057 steps (1221 resets) in 151 ms. (243 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 585/585 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 585/585 (removed 0) transitions.
[2024-06-02 20:01:07] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 20:01:07] [INFO ] Invariant cache hit.
[2024-06-02 20:01:07] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 20:01:07] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 20:01:07] [INFO ] Invariant cache hit.
[2024-06-02 20:01:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-02 20:01:08] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-06-02 20:01:08] [INFO ] Redundant transitions in 11 ms returned []
Running 576 sub problems to find dead transitions.
[2024-06-02 20:01:08] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 20:01:08] [INFO ] Invariant cache hit.
[2024-06-02 20:01:08] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 20:01:13] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2024-06-02 20:01:13] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-06-02 20:01:13] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-06-02 20:01:14] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-06-02 20:01:14] [INFO ] Deduced a trap composed of 137 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 20:01:18] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-06-02 20:01:19] [INFO ] Deduced a trap composed of 136 places in 94 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 20:01:21] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:01:21] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (OVERLAPS) 555/753 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/753 variables, 10/227 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/754 variables, and 227 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (OVERLAPS) 1/198 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (OVERLAPS) 555/753 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 10/227 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/753 variables, 576/803 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 20:01:52] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 753/754 variables, and 804 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 10/10 constraints]
After SMT, in 60608ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 60613ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61013 ms. Remains : 198/198 places, 585/585 transitions.
Computed a total of 33 stabilizing places and 58 stable transitions
Computed a total of 33 stabilizing places and 58 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1518 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (261 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1167972 steps, run timeout after 3001 ms. (steps per millisecond=389 ) properties seen :0 out of 1
Probabilistic random walk after 1167972 steps, saw 245240 distinct states, run finished after 3001 ms. (steps per millisecond=389 ) properties seen :0
[2024-06-02 20:02:12] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 20:02:12] [INFO ] Invariant cache hit.
[2024-06-02 20:02:12] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/166 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 538/704 variables, 166/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/704 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 49/753 variables, 32/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/753 variables, 6/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/753 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/753 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 753/754 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/166 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:02:12] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 538/704 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/704 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/704 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/704 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/753 variables, 32/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/753 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/753 variables, 6/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/753 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/753 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 753/754 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 408ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 585/585 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 198 transition count 582
Free-agglomeration rule applied 22 times.
Iterating global reduction 1 with 22 rules applied. Total rules applied 25 place count 198 transition count 560
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 56 place count 176 transition count 551
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 170 transition count 545
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 170 transition count 545
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 77 place count 170 transition count 536
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 104 place count 170 transition count 509
Applied a total of 104 rules in 22 ms. Remains 170 /198 variables (removed 28) and now considering 509/585 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 170/198 places, 509/585 transitions.
RANDOM walk for 40000 steps (1359 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (263 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1177610 steps, run timeout after 3001 ms. (steps per millisecond=392 ) properties seen :0 out of 1
Probabilistic random walk after 1177610 steps, saw 299416 distinct states, run finished after 3001 ms. (steps per millisecond=392 ) properties seen :0
[2024-06-02 20:02:15] [INFO ] Flow matrix only has 498 transitions (discarded 11 similar events)
// Phase 1: matrix 498 rows 170 cols
[2024-06-02 20:02:15] [INFO ] Computed 10 invariants in 10 ms
[2024-06-02 20:02:15] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/144 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 489/633 variables, 144/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/633 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/633 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/667 variables, 25/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 85/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/668 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/668 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/668 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/668 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 668/668 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/144 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 489/633 variables, 144/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/633 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/633 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/633 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/667 variables, 25/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 85/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/667 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/668 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/668 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/668 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/668 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/668 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 375ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 509/509 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 509/509 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 170/170 places, 509/509 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 509/509 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 509/509 (removed 0) transitions.
[2024-06-02 20:02:15] [INFO ] Flow matrix only has 498 transitions (discarded 11 similar events)
[2024-06-02 20:02:15] [INFO ] Invariant cache hit.
[2024-06-02 20:02:16] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 20:02:16] [INFO ] Flow matrix only has 498 transitions (discarded 11 similar events)
[2024-06-02 20:02:16] [INFO ] Invariant cache hit.
[2024-06-02 20:02:16] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-06-02 20:02:16] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-06-02 20:02:16] [INFO ] Redundant transitions in 8 ms returned []
Running 501 sub problems to find dead transitions.
[2024-06-02 20:02:16] [INFO ] Flow matrix only has 498 transitions (discarded 11 similar events)
[2024-06-02 20:02:16] [INFO ] Invariant cache hit.
[2024-06-02 20:02:16] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 20:02:20] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-06-02 20:02:20] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:02:20] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:02:20] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-06-02 20:02:20] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-06-02 20:02:20] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:02:21] [INFO ] Deduced a trap composed of 121 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 20:02:24] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (OVERLAPS) 498/668 variables, 170/188 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (OVERLAPS) 0/668 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 501 unsolved
No progress, stopping.
After SMT solving in domain Real declared 668/668 variables, and 280 constraints, problems are : Problem set: 0 solved, 501 unsolved in 28419 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 20:02:47] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (OVERLAPS) 498/668 variables, 170/189 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 92/281 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 501/782 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/668 variables, and 782 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 9/9 constraints]
After SMT, in 59045ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 59051ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59515 ms. Remains : 170/170 places, 509/509 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 114 edges and 170 vertex of which 28 / 170 are part of one of the 4 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 172 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 143 transition count 334
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 143 transition count 334
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 143 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 142 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 1 with 28 rules applied. Total rules applied 52 place count 142 transition count 290
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 142 transition count 284
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 67 place count 136 transition count 281
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 67 place count 136 transition count 278
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 73 place count 133 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 132 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 132 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 131 transition count 275
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 130 transition count 242
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 130 transition count 242
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 130 transition count 238
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 88 place count 126 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 92 place count 126 transition count 234
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 94 place count 126 transition count 232
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 124 transition count 232
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 102 place count 124 transition count 232
Applied a total of 102 rules in 33 ms. Remains 124 /170 variables (removed 46) and now considering 232/509 (removed 277) transitions.
Running SMT prover for 1 properties.
[2024-06-02 20:03:15] [INFO ] Flow matrix only has 228 transitions (discarded 4 similar events)
// Phase 1: matrix 228 rows 124 cols
[2024-06-02 20:03:15] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:03:15] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:03:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 20:03:15] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:03:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-02 20:03:15] [INFO ] After 14ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 20:03:15] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 20:03:15] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 206 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12 reset in 147 ms.
Product exploration explored 100000 steps with 1 reset in 75 ms.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 585/585 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 585/585 (removed 0) transitions.
[2024-06-02 20:03:16] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
// Phase 1: matrix 556 rows 198 cols
[2024-06-02 20:03:16] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 20:03:16] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 20:03:16] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 20:03:16] [INFO ] Invariant cache hit.
[2024-06-02 20:03:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-02 20:03:16] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-06-02 20:03:16] [INFO ] Redundant transitions in 6 ms returned []
Running 576 sub problems to find dead transitions.
[2024-06-02 20:03:16] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 20:03:16] [INFO ] Invariant cache hit.
[2024-06-02 20:03:16] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 20:03:21] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:03:21] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2024-06-02 20:03:22] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-02 20:03:22] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-06-02 20:03:23] [INFO ] Deduced a trap composed of 137 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 20:03:27] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:03:27] [INFO ] Deduced a trap composed of 136 places in 97 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 20:03:30] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-06-02 20:03:30] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (OVERLAPS) 555/753 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/753 variables, 10/227 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/754 variables, and 227 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (OVERLAPS) 1/198 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (OVERLAPS) 555/753 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 10/227 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/753 variables, 576/803 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 20:04:01] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 753/754 variables, and 804 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 10/10 constraints]
After SMT, in 60635ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 60641ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61049 ms. Remains : 198/198 places, 585/585 transitions.
Treatment of property FireWire-PT-20-LTLCardinality-01 finished in 255031 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(((X(!p1) U G(!p2))||p0)))'
Support contains 6 out of 419 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 : 419/419 places, 707/707 transitions.
Graph (trivial) has 284 edges and 419 vertex of which 9 / 419 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 412 transition count 649
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 58 rules applied. Total rules applied 110 place count 361 transition count 642
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 114 place count 358 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 357 transition count 641
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 115 place count 357 transition count 603
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 191 place count 319 transition count 603
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 201 place count 309 transition count 589
Iterating global reduction 4 with 10 rules applied. Total rules applied 211 place count 309 transition count 589
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 211 place count 309 transition count 585
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 219 place count 305 transition count 585
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 224 place count 300 transition count 578
Iterating global reduction 4 with 5 rules applied. Total rules applied 229 place count 300 transition count 578
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 232 place count 297 transition count 571
Iterating global reduction 4 with 3 rules applied. Total rules applied 235 place count 297 transition count 571
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 295 transition count 566
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 295 transition count 566
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 241 place count 293 transition count 561
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 293 transition count 561
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 245 place count 291 transition count 556
Iterating global reduction 4 with 2 rules applied. Total rules applied 247 place count 291 transition count 556
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 249 place count 289 transition count 552
Iterating global reduction 4 with 2 rules applied. Total rules applied 251 place count 289 transition count 552
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 253 place count 287 transition count 547
Iterating global reduction 4 with 2 rules applied. Total rules applied 255 place count 287 transition count 547
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 256 place count 286 transition count 545
Iterating global reduction 4 with 1 rules applied. Total rules applied 257 place count 286 transition count 545
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 258 place count 285 transition count 542
Iterating global reduction 4 with 1 rules applied. Total rules applied 259 place count 285 transition count 542
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 260 place count 284 transition count 540
Iterating global reduction 4 with 1 rules applied. Total rules applied 261 place count 284 transition count 540
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 262 place count 283 transition count 537
Iterating global reduction 4 with 1 rules applied. Total rules applied 263 place count 283 transition count 537
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 264 place count 282 transition count 535
Iterating global reduction 4 with 1 rules applied. Total rules applied 265 place count 282 transition count 535
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 266 place count 281 transition count 533
Iterating global reduction 4 with 1 rules applied. Total rules applied 267 place count 281 transition count 533
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 268 place count 280 transition count 531
Iterating global reduction 4 with 1 rules applied. Total rules applied 269 place count 280 transition count 531
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 337 place count 246 transition count 497
Performed 41 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 419 place count 205 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 422 place count 205 transition count 583
Applied a total of 422 rules in 72 ms. Remains 205 /419 variables (removed 214) and now considering 583/707 (removed 124) transitions.
[2024-06-02 20:04:17] [INFO ] Flow matrix only has 560 transitions (discarded 23 similar events)
// Phase 1: matrix 560 rows 205 cols
[2024-06-02 20:04:17] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 20:04:17] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 20:04:17] [INFO ] Flow matrix only has 560 transitions (discarded 23 similar events)
[2024-06-02 20:04:17] [INFO ] Invariant cache hit.
[2024-06-02 20:04:17] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 20:04:17] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-06-02 20:04:17] [INFO ] Redundant transitions in 7 ms returned []
Running 580 sub problems to find dead transitions.
[2024-06-02 20:04:17] [INFO ] Flow matrix only has 560 transitions (discarded 23 similar events)
[2024-06-02 20:04:17] [INFO ] Invariant cache hit.
[2024-06-02 20:04:17] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 1/205 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 580 unsolved
[2024-06-02 20:04:23] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2024-06-02 20:04:23] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-06-02 20:04:24] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:04:24] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:04:24] [INFO ] Deduced a trap composed of 131 places in 93 ms of which 1 ms to minimize.
[2024-06-02 20:04:24] [INFO ] Deduced a trap composed of 146 places in 92 ms of which 1 ms to minimize.
[2024-06-02 20:04:24] [INFO ] Deduced a trap composed of 143 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (OVERLAPS) 559/764 variables, 205/222 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 12/234 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 8 (OVERLAPS) 0/764 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 580 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/765 variables, and 234 constraints, problems are : Problem set: 0 solved, 580 unsolved in 25412 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 205/205 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (OVERLAPS) 1/205 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 580 unsolved
[2024-06-02 20:04:47] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-06-02 20:04:47] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-06-02 20:04:48] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 7 (OVERLAPS) 559/764 variables, 205/225 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/764 variables, 580/817 constraints. Problems are: Problem set: 0 solved, 580 unsolved
[2024-06-02 20:05:03] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/764 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/765 variables, and 818 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 205/205 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 11/11 constraints]
After SMT, in 55930ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 55936ms
Starting structural reductions in SI_LTL mode, iteration 1 : 205/419 places, 583/707 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56556 ms. Remains : 205/419 places, 583/707 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) p2)]
Running random walk in product with property : FireWire-PT-20-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLCardinality-02 finished in 56612 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(p2)&&p1))))'
Support contains 7 out of 419 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 707/707 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 410 transition count 695
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 410 transition count 695
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 405 transition count 687
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 405 transition count 687
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 404 transition count 684
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 404 transition count 684
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 403 transition count 682
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 403 transition count 682
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 402 transition count 679
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 402 transition count 679
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 401 transition count 677
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 401 transition count 677
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 400 transition count 675
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 400 transition count 675
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 399 transition count 673
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 399 transition count 673
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 398 transition count 672
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 398 transition count 672
Applied a total of 42 rules in 37 ms. Remains 398 /419 variables (removed 21) and now considering 672/707 (removed 35) transitions.
// Phase 1: matrix 672 rows 398 cols
[2024-06-02 20:05:13] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 20:05:14] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 20:05:14] [INFO ] Invariant cache hit.
[2024-06-02 20:05:14] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2024-06-02 20:05:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (OVERLAPS) 1/398 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-06-02 20:05:22] [INFO ] Deduced a trap composed of 281 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:05:22] [INFO ] Deduced a trap composed of 242 places in 127 ms of which 2 ms to minimize.
[2024-06-02 20:05:22] [INFO ] Deduced a trap composed of 231 places in 122 ms of which 2 ms to minimize.
[2024-06-02 20:05:22] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:05:22] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:05:22] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:05:23] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 2 ms to minimize.
[2024-06-02 20:05:23] [INFO ] Deduced a trap composed of 229 places in 128 ms of which 3 ms to minimize.
[2024-06-02 20:05:23] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 3 ms to minimize.
[2024-06-02 20:05:23] [INFO ] Deduced a trap composed of 95 places in 73 ms of which 2 ms to minimize.
[2024-06-02 20:05:24] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 2 ms to minimize.
[2024-06-02 20:05:24] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 2 ms to minimize.
[2024-06-02 20:05:24] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:05:25] [INFO ] Deduced a trap composed of 135 places in 128 ms of which 2 ms to minimize.
[2024-06-02 20:05:26] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:05:26] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:05:28] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:05:29] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-06-02 20:05:30] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:05:30] [INFO ] Deduced a trap composed of 107 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:05:30] [INFO ] Deduced a trap composed of 241 places in 112 ms of which 2 ms to minimize.
[2024-06-02 20:05:31] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 3 ms to minimize.
[2024-06-02 20:05:32] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1070 variables, and 33 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/398 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (OVERLAPS) 1/398 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 4 (OVERLAPS) 672/1070 variables, 398/431 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1070 variables, 671/1102 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-06-02 20:06:03] [INFO ] Deduced a trap composed of 121 places in 141 ms of which 2 ms to minimize.
[2024-06-02 20:06:10] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:06:11] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1070/1070 variables, and 1105 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 26/26 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 60305ms
Starting structural reductions in LTL mode, iteration 1 : 398/419 places, 672/707 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60876 ms. Remains : 398/419 places, 672/707 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : FireWire-PT-20-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLCardinality-05 finished in 61097 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&&F(p0))))'
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 419/419 places, 707/707 transitions.
Graph (trivial) has 293 edges and 419 vertex of which 11 / 419 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 410 transition count 645
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 59 rules applied. Total rules applied 112 place count 358 transition count 638
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 115 place count 355 transition count 638
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 115 place count 355 transition count 601
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 189 place count 318 transition count 601
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 201 place count 306 transition count 585
Iterating global reduction 3 with 12 rules applied. Total rules applied 213 place count 306 transition count 585
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 213 place count 306 transition count 580
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 223 place count 301 transition count 580
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 230 place count 294 transition count 569
Iterating global reduction 3 with 7 rules applied. Total rules applied 237 place count 294 transition count 569
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 240 place count 291 transition count 562
Iterating global reduction 3 with 3 rules applied. Total rules applied 243 place count 291 transition count 562
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 245 place count 289 transition count 557
Iterating global reduction 3 with 2 rules applied. Total rules applied 247 place count 289 transition count 557
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 249 place count 287 transition count 552
Iterating global reduction 3 with 2 rules applied. Total rules applied 251 place count 287 transition count 552
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 253 place count 285 transition count 547
Iterating global reduction 3 with 2 rules applied. Total rules applied 255 place count 285 transition count 547
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 257 place count 283 transition count 543
Iterating global reduction 3 with 2 rules applied. Total rules applied 259 place count 283 transition count 543
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 261 place count 281 transition count 538
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 281 transition count 538
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 264 place count 280 transition count 536
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 280 transition count 536
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 279 transition count 533
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 279 transition count 533
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 278 transition count 531
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 278 transition count 531
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 277 transition count 528
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 277 transition count 528
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 272 place count 276 transition count 526
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 276 transition count 526
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 274 place count 275 transition count 524
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 275 transition count 524
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 274 transition count 522
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 274 transition count 522
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 343 place count 241 transition count 489
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 433 place count 196 transition count 588
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 436 place count 196 transition count 585
Applied a total of 436 rules in 83 ms. Remains 196 /419 variables (removed 223) and now considering 585/707 (removed 122) transitions.
[2024-06-02 20:06:15] [INFO ] Flow matrix only has 559 transitions (discarded 26 similar events)
// Phase 1: matrix 559 rows 196 cols
[2024-06-02 20:06:15] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:06:15] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 20:06:15] [INFO ] Flow matrix only has 559 transitions (discarded 26 similar events)
[2024-06-02 20:06:15] [INFO ] Invariant cache hit.
[2024-06-02 20:06:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 20:06:15] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-06-02 20:06:15] [INFO ] Redundant transitions in 5 ms returned []
Running 576 sub problems to find dead transitions.
[2024-06-02 20:06:15] [INFO ] Flow matrix only has 559 transitions (discarded 26 similar events)
[2024-06-02 20:06:15] [INFO ] Invariant cache hit.
[2024-06-02 20:06:15] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 20:06:20] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2024-06-02 20:06:20] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-06-02 20:06:20] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2024-06-02 20:06:21] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2024-06-02 20:06:21] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-06-02 20:06:21] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-06-02 20:06:22] [INFO ] Deduced a trap composed of 138 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:06:22] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (OVERLAPS) 558/754 variables, 196/214 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 12/226 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 8 (OVERLAPS) 0/754 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 576 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/755 variables, and 226 constraints, problems are : Problem set: 0 solved, 576 unsolved in 23746 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (OVERLAPS) 558/754 variables, 196/214 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 12/226 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 576/802 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 20:06:55] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 1/803 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 754/755 variables, and 803 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 9/9 constraints]
After SMT, in 54342ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 54348ms
Starting structural reductions in SI_LTL mode, iteration 1 : 196/419 places, 585/707 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54816 ms. Remains : 196/419 places, 585/707 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLCardinality-11 finished in 54907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 419/419 places, 707/707 transitions.
Graph (trivial) has 295 edges and 419 vertex of which 11 / 419 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 410 transition count 644
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 357 transition count 637
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 354 transition count 637
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 117 place count 354 transition count 599
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 193 place count 316 transition count 599
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 205 place count 304 transition count 583
Iterating global reduction 3 with 12 rules applied. Total rules applied 217 place count 304 transition count 583
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 217 place count 304 transition count 578
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 227 place count 299 transition count 578
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 233 place count 293 transition count 568
Iterating global reduction 3 with 6 rules applied. Total rules applied 239 place count 293 transition count 568
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 242 place count 290 transition count 561
Iterating global reduction 3 with 3 rules applied. Total rules applied 245 place count 290 transition count 561
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 247 place count 288 transition count 556
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 288 transition count 556
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 251 place count 286 transition count 551
Iterating global reduction 3 with 2 rules applied. Total rules applied 253 place count 286 transition count 551
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 255 place count 284 transition count 546
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 284 transition count 546
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 259 place count 282 transition count 542
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 282 transition count 542
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 263 place count 280 transition count 537
Iterating global reduction 3 with 2 rules applied. Total rules applied 265 place count 280 transition count 537
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 279 transition count 535
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 279 transition count 535
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 278 transition count 532
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 278 transition count 532
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 277 transition count 530
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 277 transition count 530
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 272 place count 276 transition count 527
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 276 transition count 527
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 274 place count 275 transition count 525
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 275 transition count 525
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 274 transition count 523
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 274 transition count 523
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 278 place count 273 transition count 521
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 273 transition count 521
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 345 place count 240 transition count 488
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 433 place count 196 transition count 582
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 436 place count 196 transition count 579
Applied a total of 436 rules in 83 ms. Remains 196 /419 variables (removed 223) and now considering 579/707 (removed 128) transitions.
[2024-06-02 20:07:09] [INFO ] Flow matrix only has 553 transitions (discarded 26 similar events)
// Phase 1: matrix 553 rows 196 cols
[2024-06-02 20:07:09] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 20:07:10] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 20:07:10] [INFO ] Flow matrix only has 553 transitions (discarded 26 similar events)
[2024-06-02 20:07:10] [INFO ] Invariant cache hit.
[2024-06-02 20:07:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 20:07:10] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-06-02 20:07:10] [INFO ] Redundant transitions in 6 ms returned []
Running 570 sub problems to find dead transitions.
[2024-06-02 20:07:10] [INFO ] Flow matrix only has 553 transitions (discarded 26 similar events)
[2024-06-02 20:07:10] [INFO ] Invariant cache hit.
[2024-06-02 20:07:10] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-06-02 20:07:15] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2024-06-02 20:07:15] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-06-02 20:07:15] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-06-02 20:07:16] [INFO ] Deduced a trap composed of 138 places in 90 ms of which 1 ms to minimize.
[2024-06-02 20:07:16] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-06-02 20:07:20] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-06-02 20:07:21] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-06-02 20:07:21] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2024-06-02 20:07:21] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 6 (OVERLAPS) 552/748 variables, 196/215 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/748 variables, 12/227 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 9 (OVERLAPS) 0/748 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 570 unsolved
No progress, stopping.
After SMT solving in domain Real declared 748/749 variables, and 227 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 570 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 6 (OVERLAPS) 552/748 variables, 196/215 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/748 variables, 12/227 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 570/797 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/748 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/749 variables, and 797 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 9/9 constraints]
After SMT, in 60615ms problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 60621ms
Starting structural reductions in SI_LTL mode, iteration 1 : 196/419 places, 579/707 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61246 ms. Remains : 196/419 places, 579/707 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLCardinality-12 finished in 61304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-02 20:08:11] [INFO ] Flatten gal took : 34 ms
[2024-06-02 20:08:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-02 20:08:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 419 places, 707 transitions and 2210 arcs took 4 ms.
Total runtime 691127 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FireWire-PT-20-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717359127740

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FireWire-PT-20-LTLCardinality-01
ltl formula formula --ltl=/tmp/1462/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 419 places, 707 transitions and 2210 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1462/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1462/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1462/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1462/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 421 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 420, there are 716 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~315 levels ~10000 states ~25472 transitions
pnml2lts-mc( 0/ 4): ~356 levels ~20000 states ~49612 transitions
pnml2lts-mc( 1/ 4): ~550 levels ~40000 states ~106796 transitions
pnml2lts-mc( 1/ 4): ~733 levels ~80000 states ~210464 transitions
pnml2lts-mc( 1/ 4): ~838 levels ~160000 states ~449536 transitions
pnml2lts-mc( 1/ 4): ~838 levels ~320000 states ~1037372 transitions
pnml2lts-mc( 0/ 4): ~474 levels ~640000 states ~2463132 transitions
pnml2lts-mc( 1/ 4): ~1512 levels ~1280000 states ~4629612 transitions
pnml2lts-mc( 3/ 4): ~934 levels ~2560000 states ~9302856 transitions
pnml2lts-mc( 3/ 4): ~1006 levels ~5120000 states ~20306236 transitions
pnml2lts-mc( 3/ 4): ~1802 levels ~10240000 states ~42053276 transitions
pnml2lts-mc( 3/ 4): ~1862 levels ~20480000 states ~94471528 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~289!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10941449
pnml2lts-mc( 0/ 4): unique states count: 21376245
pnml2lts-mc( 0/ 4): unique transitions count: 106226035
pnml2lts-mc( 0/ 4): - self-loop count: 108032
pnml2lts-mc( 0/ 4): - claim dead count: 72587828
pnml2lts-mc( 0/ 4): - claim found count: 12160867
pnml2lts-mc( 0/ 4): - claim success count: 21379555
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5704
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21381093 states 106248481 transitions, fanout: 4.969
pnml2lts-mc( 0/ 4): Total exploration time 235.710 sec (235.710 sec minimum, 235.710 sec on average)
pnml2lts-mc( 0/ 4): States per second: 90709, Transitions per second: 450759
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 169.3MB, 8.3 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 63.0%/9.0%
pnml2lts-mc( 0/ 4): Stored 719 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 169.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901400323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-20.tgz
mv FireWire-PT-20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;