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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 153K 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-13-LTLFireability-00
FORMULA_NAME FireWire-PT-13-LTLFireability-01
FORMULA_NAME FireWire-PT-13-LTLFireability-02
FORMULA_NAME FireWire-PT-13-LTLFireability-03
FORMULA_NAME FireWire-PT-13-LTLFireability-04
FORMULA_NAME FireWire-PT-13-LTLFireability-05
FORMULA_NAME FireWire-PT-13-LTLFireability-06
FORMULA_NAME FireWire-PT-13-LTLFireability-07
FORMULA_NAME FireWire-PT-13-LTLFireability-08
FORMULA_NAME FireWire-PT-13-LTLFireability-09
FORMULA_NAME FireWire-PT-13-LTLFireability-10
FORMULA_NAME FireWire-PT-13-LTLFireability-11
FORMULA_NAME FireWire-PT-13-LTLFireability-12
FORMULA_NAME FireWire-PT-13-LTLFireability-13
FORMULA_NAME FireWire-PT-13-LTLFireability-14
FORMULA_NAME FireWire-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717369031219

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:57:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:57:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:57:12] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-06-02 22:57:12] [INFO ] Transformed 205 places.
[2024-06-02 22:57:12] [INFO ] Transformed 610 transitions.
[2024-06-02 22:57:12] [INFO ] Found NUPN structural information;
[2024-06-02 22:57:12] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
FORMULA FireWire-PT-13-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 542/542 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 201 transition count 534
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 201 transition count 534
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 201 transition count 533
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 200 transition count 530
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 200 transition count 530
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 199 transition count 528
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 199 transition count 528
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 198 transition count 525
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 198 transition count 525
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 197 transition count 523
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 197 transition count 523
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 197 transition count 517
Applied a total of 23 rules in 81 ms. Remains 197 /205 variables (removed 8) and now considering 517/542 (removed 25) transitions.
[2024-06-02 22:57:12] [INFO ] Flow matrix only has 485 transitions (discarded 32 similar events)
// Phase 1: matrix 485 rows 197 cols
[2024-06-02 22:57:12] [INFO ] Computed 10 invariants in 28 ms
[2024-06-02 22:57:13] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-06-02 22:57:13] [INFO ] Flow matrix only has 485 transitions (discarded 32 similar events)
[2024-06-02 22:57:13] [INFO ] Invariant cache hit.
[2024-06-02 22:57:13] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 22:57:13] [INFO ] Implicit Places using invariants and state equation in 525 ms returned [21, 83, 142]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 833 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/205 places, 517/542 transitions.
Applied a total of 0 rules in 5 ms. Remains 194 /194 variables (removed 0) and now considering 517/517 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 934 ms. Remains : 194/205 places, 517/542 transitions.
Support contains 40 out of 194 places after structural reductions.
[2024-06-02 22:57:13] [INFO ] Flatten gal took : 67 ms
[2024-06-02 22:57:13] [INFO ] Flatten gal took : 40 ms
[2024-06-02 22:57:14] [INFO ] Input system was already deterministic with 517 transitions.
Reduction of identical properties reduced properties to check from 32 to 30
RANDOM walk for 40000 steps (1152 resets) in 1936 ms. (20 steps per ms) remains 11/30 properties
BEST_FIRST walk for 40003 steps (55 resets) in 283 ms. (140 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (527 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (49 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (241 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (260 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (246 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (250 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
[2024-06-02 22:57:15] [INFO ] Flow matrix only has 485 transitions (discarded 32 similar events)
// Phase 1: matrix 485 rows 194 cols
[2024-06-02 22:57:15] [INFO ] Computed 7 invariants in 10 ms
[2024-06-02 22:57:15] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 157/170 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 9/179 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-02 22:57:15] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 13 ms to minimize.
[2024-06-02 22:57:15] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 472/651 variables, 179/188 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 67/255 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 27/678 variables, 15/270 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/678 variables, 3/273 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/678 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/679 variables, 1/274 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/679 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/679 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 679/679 variables, and 274 constraints, problems are : Problem set: 1 solved, 7 unsolved in 1010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 194/194 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 161/170 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 9/179 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-02 22:57:16] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 472/651 variables, 179/189 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 67/256 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 7/263 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 0/263 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 27/678 variables, 15/278 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/678 variables, 3/281 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-02 22:57:17] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/678 variables, 1/282 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/678 variables, 0/282 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1/679 variables, 1/283 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/679 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/679 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 679/679 variables, and 283 constraints, problems are : Problem set: 1 solved, 7 unsolved in 1719 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 194/194 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 2806ms problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 6430 ms.
Support contains 9 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 517/517 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 194 transition count 514
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 194 transition count 511
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 191 transition count 511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 190 transition count 509
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 190 transition count 509
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 190 transition count 508
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 187 transition count 505
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 184 transition count 511
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 184 transition count 505
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 33 place count 184 transition count 502
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 184 transition count 508
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 45 place count 181 transition count 502
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 51 place count 181 transition count 496
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 180 transition count 495
Applied a total of 52 rules in 135 ms. Remains 180 /194 variables (removed 14) and now considering 495/517 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 180/194 places, 495/517 transitions.
RANDOM walk for 40000 steps (1251 resets) in 1006 ms. (39 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (30 resets) in 553 ms. (72 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (690 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (30 resets) in 126 ms. (314 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (271 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (273 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (279 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (248 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
[2024-06-02 22:57:25] [INFO ] Flow matrix only has 458 transitions (discarded 37 similar events)
// Phase 1: matrix 458 rows 180 cols
[2024-06-02 22:57:25] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:57:25] [INFO ] State equation strengthened by 69 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 155/162 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 446/608 variables, 162/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/608 variables, 69/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 27/635 variables, 15/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/635 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/635 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 3/638 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/638 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 638/638 variables, and 256 constraints, problems are : Problem set: 0 solved, 6 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 155/162 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 446/608 variables, 162/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/608 variables, 69/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 6/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 27/635 variables, 15/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/635 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/635 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/638 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/638 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/638 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 638/638 variables, and 262 constraints, problems are : Problem set: 0 solved, 6 unsolved in 982 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1478ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3180 ms.
Support contains 7 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 495/495 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 179 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 179 transition count 493
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 179 transition count 492
Applied a total of 3 rules in 17 ms. Remains 179 /180 variables (removed 1) and now considering 492/495 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 179/180 places, 492/495 transitions.
RANDOM walk for 40000 steps (1248 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (32 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (38 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (272 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (273 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (273 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (291 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 481443 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 6
Probabilistic random walk after 481443 steps, saw 121539 distinct states, run finished after 3006 ms. (steps per millisecond=160 ) properties seen :0
[2024-06-02 22:57:33] [INFO ] Flow matrix only has 455 transitions (discarded 37 similar events)
// Phase 1: matrix 455 rows 179 cols
[2024-06-02 22:57:33] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:57:33] [INFO ] State equation strengthened by 69 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 154/161 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 443/604 variables, 161/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 69/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 27/631 variables, 15/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 3/634 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/634 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/634 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 634/634 variables, and 255 constraints, problems are : Problem set: 0 solved, 6 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/179 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 154/161 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 443/604 variables, 161/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 69/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 6/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 27/631 variables, 15/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/634 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/634 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/634 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 634/634 variables, and 261 constraints, problems are : Problem set: 0 solved, 6 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/179 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1438ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2755 ms.
Support contains 7 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 492/492 transitions.
Applied a total of 0 rules in 10 ms. Remains 179 /179 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 179/179 places, 492/492 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 492/492 transitions.
Applied a total of 0 rules in 9 ms. Remains 179 /179 variables (removed 0) and now considering 492/492 (removed 0) transitions.
[2024-06-02 22:57:37] [INFO ] Flow matrix only has 455 transitions (discarded 37 similar events)
[2024-06-02 22:57:37] [INFO ] Invariant cache hit.
[2024-06-02 22:57:37] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 22:57:37] [INFO ] Flow matrix only has 455 transitions (discarded 37 similar events)
[2024-06-02 22:57:37] [INFO ] Invariant cache hit.
[2024-06-02 22:57:37] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 22:57:37] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2024-06-02 22:57:37] [INFO ] Redundant transitions in 30 ms returned []
Running 486 sub problems to find dead transitions.
[2024-06-02 22:57:37] [INFO ] Flow matrix only has 455 transitions (discarded 37 similar events)
[2024-06-02 22:57:37] [INFO ] Invariant cache hit.
[2024-06-02 22:57:37] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 486 unsolved
[2024-06-02 22:57:40] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 1 ms to minimize.
[2024-06-02 22:57:40] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:57:40] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-06-02 22:57:40] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:57:40] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:57:41] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:57:41] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 6 ms to minimize.
[2024-06-02 22:57:41] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:57:42] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:57:43] [INFO ] Deduced a trap composed of 113 places in 97 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 3 (OVERLAPS) 455/634 variables, 179/196 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 69/265 constraints. Problems are: Problem set: 0 solved, 486 unsolved
[2024-06-02 22:57:49] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:57:51] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:57:52] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/634 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 486 unsolved
[2024-06-02 22:57:58] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:57:58] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/634 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 486 unsolved
[2024-06-02 22:58:04] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/634 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 486 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 634/634 variables, and 271 constraints, problems are : Problem set: 0 solved, 486 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/179 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 486/486 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 486 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 3 (OVERLAPS) 455/634 variables, 179/202 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 69/271 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/634 variables, 486/757 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/634 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 486 unsolved
[2024-06-02 22:58:34] [INFO ] Deduced a trap composed of 114 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/634 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 486 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 634/634 variables, and 758 constraints, problems are : Problem set: 0 solved, 486 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/179 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 486/486 constraints, Known Traps: 17/17 constraints]
After SMT, in 60637ms problems are : Problem set: 0 solved, 486 unsolved
Search for dead transitions found 0 dead transitions in 60643ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61120 ms. Remains : 179/179 places, 492/492 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 147 edges and 179 vertex of which 29 / 179 are part of one of the 4 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
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 3 place count 153 transition count 347
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 153 transition count 338
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 14 place count 152 transition count 337
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 15 place count 152 transition count 336
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 17 place count 151 transition count 335
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 151 transition count 320
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 142 transition count 317
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 142 transition count 317
Applied a total of 44 rules in 48 ms. Remains 142 /179 variables (removed 37) and now considering 317/492 (removed 175) transitions.
Running SMT prover for 6 properties.
[2024-06-02 22:58:38] [INFO ] Flow matrix only has 315 transitions (discarded 2 similar events)
// Phase 1: matrix 315 rows 142 cols
[2024-06-02 22:58:38] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:58:38] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:58:38] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 22:58:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:58:39] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-02 22:58:39] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:58:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-06-02 22:58:39] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:58:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-02 22:58:39] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:58:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
TRAPS : Iteration 1
[2024-06-02 22:58:39] [INFO ] After 642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-02 22:58:39] [INFO ] After 825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 1168 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA FireWire-PT-13-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 120 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' '!(X((F(p0)||X(G((p1||X(G(p2))))))))'
Support contains 6 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 189 transition count 504
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 189 transition count 504
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 189 transition count 502
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 186 transition count 496
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 186 transition count 496
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 183 transition count 487
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 183 transition count 487
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 180 transition count 481
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 180 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 178 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 178 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 176 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 176 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 174 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 174 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 172 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 172 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 170 transition count 455
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 170 transition count 455
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 168 transition count 451
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 168 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 167 transition count 449
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 167 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 166 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 166 transition count 447
Applied a total of 58 rules in 43 ms. Remains 166 /194 variables (removed 28) and now considering 447/517 (removed 70) transitions.
[2024-06-02 22:58:40] [INFO ] Flow matrix only has 415 transitions (discarded 32 similar events)
// Phase 1: matrix 415 rows 166 cols
[2024-06-02 22:58:40] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:58:40] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-06-02 22:58:40] [INFO ] Flow matrix only has 415 transitions (discarded 32 similar events)
[2024-06-02 22:58:40] [INFO ] Invariant cache hit.
[2024-06-02 22:58:40] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 22:58:40] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2024-06-02 22:58:40] [INFO ] Flow matrix only has 415 transitions (discarded 32 similar events)
[2024-06-02 22:58:40] [INFO ] Invariant cache hit.
[2024-06-02 22:58:40] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-06-02 22:58:43] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:58:44] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:58:44] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:58:44] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:58:44] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:58:44] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-06-02 22:58:45] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:58:45] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (OVERLAPS) 414/580 variables, 166/181 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 58/239 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (OVERLAPS) 1/581 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 9 (OVERLAPS) 0/581 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 446 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 240 constraints, problems are : Problem set: 0 solved, 446 unsolved in 26258 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (OVERLAPS) 414/580 variables, 166/181 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 58/239 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 446/685 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-06-02 22:59:16] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:59:22] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 3 ms to minimize.
[2024-06-02 22:59:23] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 2 ms to minimize.
[2024-06-02 22:59:23] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 4/689 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 446 unsolved
SMT process timed out in 56647ms, After SMT, problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 56656ms
Starting structural reductions in LTL mode, iteration 1 : 166/194 places, 447/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57338 ms. Remains : 166/194 places, 447/517 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 344 ms.
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Computed a total of 25 stabilizing places and 56 stable transitions
Computed a total of 25 stabilizing places and 56 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 60 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-13-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-13-LTLFireability-00 finished in 58313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&(p1||G(p2)))))'
Support contains 6 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 186 transition count 502
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 186 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 186 transition count 501
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 183 transition count 495
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 183 transition count 495
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 180 transition count 486
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 180 transition count 486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 177 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 177 transition count 480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 174 transition count 471
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 174 transition count 471
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 171 transition count 465
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 171 transition count 465
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 168 transition count 457
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 168 transition count 457
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 165 transition count 451
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 165 transition count 451
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 163 transition count 445
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 163 transition count 445
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 161 transition count 441
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 161 transition count 441
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 159 transition count 437
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 159 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 157 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 157 transition count 433
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 79 place count 154 transition count 430
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 151 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 91 place count 151 transition count 430
Applied a total of 91 rules in 143 ms. Remains 151 /194 variables (removed 43) and now considering 430/517 (removed 87) transitions.
[2024-06-02 22:59:38] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
// Phase 1: matrix 391 rows 151 cols
[2024-06-02 22:59:38] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:59:38] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-02 22:59:38] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 22:59:38] [INFO ] Invariant cache hit.
[2024-06-02 22:59:38] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:59:38] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2024-06-02 22:59:38] [INFO ] Redundant transitions in 15 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-02 22:59:39] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 22:59:39] [INFO ] Invariant cache hit.
[2024-06-02 22:59:39] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 22:59:40] [INFO ] Deduced a trap composed of 60 places in 131 ms of which 1 ms to minimize.
[2024-06-02 22:59:40] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:59:40] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:59:41] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:59:41] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 2 ms to minimize.
[2024-06-02 22:59:41] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:59:41] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:59:41] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:59:41] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-06-02 22:59:42] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-06-02 22:59:42] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 390/541 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 22:59:47] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 1 ms to minimize.
[2024-06-02 22:59:47] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:59:50] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 3 ms to minimize.
[2024-06-02 22:59:50] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 0/541 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/542 variables, and 229 constraints, problems are : Problem set: 0 solved, 423 unsolved in 21433 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:00:02] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (OVERLAPS) 390/541 variables, 151/174 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 56/230 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 423/653 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:00:08] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 9 (OVERLAPS) 0/541 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/542 variables, and 654 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 17/17 constraints]
After SMT, in 51793ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 51796ms
Starting structural reductions in SI_LTL mode, iteration 1 : 151/194 places, 430/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52401 ms. Remains : 151/194 places, 430/517 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-01 finished in 52552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||X(p2))))'
Support contains 5 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 190 transition count 506
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 190 transition count 506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 190 transition count 505
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 187 transition count 499
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 187 transition count 499
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 184 transition count 490
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 184 transition count 490
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 181 transition count 484
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 181 transition count 484
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 178 transition count 475
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 178 transition count 475
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 175 transition count 469
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 175 transition count 469
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 172 transition count 461
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 172 transition count 461
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 169 transition count 455
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 169 transition count 455
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 167 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 167 transition count 449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 165 transition count 445
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 165 transition count 445
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 163 transition count 441
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 163 transition count 441
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 161 transition count 437
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 161 transition count 437
Applied a total of 67 rules in 20 ms. Remains 161 /194 variables (removed 33) and now considering 437/517 (removed 80) transitions.
[2024-06-02 23:00:30] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
// Phase 1: matrix 405 rows 161 cols
[2024-06-02 23:00:30] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:00:31] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 23:00:31] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
[2024-06-02 23:00:31] [INFO ] Invariant cache hit.
[2024-06-02 23:00:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:00:31] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2024-06-02 23:00:31] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
[2024-06-02 23:00:31] [INFO ] Invariant cache hit.
[2024-06-02 23:00:31] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 23:00:34] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 1 ms to minimize.
[2024-06-02 23:00:34] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:00:34] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:00:34] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 2 ms to minimize.
[2024-06-02 23:00:35] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2024-06-02 23:00:35] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:00:35] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:00:35] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (OVERLAPS) 404/565 variables, 161/176 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 7 (OVERLAPS) 1/566 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 9 (OVERLAPS) 0/566 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 436 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 234 constraints, problems are : Problem set: 0 solved, 436 unsolved in 24616 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (OVERLAPS) 404/565 variables, 161/176 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 436/669 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 23:01:06] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:01:09] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:01:09] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 3/672 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 436 unsolved
SMT process timed out in 54981ms, After SMT, problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 54987ms
Starting structural reductions in LTL mode, iteration 1 : 161/194 places, 437/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55353 ms. Remains : 161/194 places, 437/517 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-03 finished in 55481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0))||(F(!p0)&&X(p2)&&p1)) U X(p3)))'
Support contains 6 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 189 transition count 504
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 189 transition count 504
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 189 transition count 502
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 186 transition count 496
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 186 transition count 496
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 183 transition count 487
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 183 transition count 487
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 180 transition count 481
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 180 transition count 481
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 177 transition count 472
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 177 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 175 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 175 transition count 468
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 173 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 173 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 171 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 171 transition count 459
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 170 transition count 456
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 170 transition count 456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 169 transition count 454
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 169 transition count 454
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 168 transition count 452
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 168 transition count 452
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 167 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 167 transition count 450
Applied a total of 56 rules in 15 ms. Remains 167 /194 variables (removed 27) and now considering 450/517 (removed 67) transitions.
[2024-06-02 23:01:26] [INFO ] Flow matrix only has 418 transitions (discarded 32 similar events)
// Phase 1: matrix 418 rows 167 cols
[2024-06-02 23:01:26] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:01:26] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 23:01:26] [INFO ] Flow matrix only has 418 transitions (discarded 32 similar events)
[2024-06-02 23:01:26] [INFO ] Invariant cache hit.
[2024-06-02 23:01:26] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:01:26] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2024-06-02 23:01:26] [INFO ] Flow matrix only has 418 transitions (discarded 32 similar events)
[2024-06-02 23:01:26] [INFO ] Invariant cache hit.
[2024-06-02 23:01:26] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:01:29] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 1 ms to minimize.
[2024-06-02 23:01:29] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:01:30] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:01:30] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:01:30] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2024-06-02 23:01:30] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:01:31] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:01:31] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (OVERLAPS) 417/584 variables, 167/182 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 59/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (OVERLAPS) 1/585 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 9 (OVERLAPS) 0/585 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 449 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 242 constraints, problems are : Problem set: 0 solved, 449 unsolved in 26407 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (OVERLAPS) 417/584 variables, 167/182 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 59/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 449/690 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:02:01] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:02:07] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:02:08] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 3/693 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/584 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 9 (OVERLAPS) 1/585 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/585 variables, and 694 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 11/11 constraints]
After SMT, in 56770ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 56775ms
Starting structural reductions in LTL mode, iteration 1 : 167/194 places, 450/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57207 ms. Remains : 167/194 places, 450/517 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p3), (NOT p0), (NOT p3), (NOT p3), (OR (NOT p3) (NOT p0))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-04 finished in 57446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 186 transition count 503
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 186 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 186 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 184 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 184 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 182 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 182 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 180 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 180 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 178 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 178 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 176 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 174 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 174 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 172 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 172 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 171 transition count 465
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 171 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 170 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 170 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 169 transition count 461
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 169 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 168 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 168 transition count 459
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 165 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 162 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 162 transition count 456
Applied a total of 70 rules in 68 ms. Remains 162 /194 variables (removed 32) and now considering 456/517 (removed 61) transitions.
[2024-06-02 23:02:23] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 162 cols
[2024-06-02 23:02:23] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:02:24] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-02 23:02:24] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:02:24] [INFO ] Invariant cache hit.
[2024-06-02 23:02:24] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:02:24] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2024-06-02 23:02:24] [INFO ] Redundant transitions in 4 ms returned []
Running 449 sub problems to find dead transitions.
[2024-06-02 23:02:24] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:02:24] [INFO ] Invariant cache hit.
[2024-06-02 23:02:24] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:02:26] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:02:26] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:02:26] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:02:26] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:02:26] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:02:26] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:02:27] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:02:27] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:02:27] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:02:30] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:02:30] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (OVERLAPS) 416/578 variables, 162/180 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 61/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:02:34] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:02:34] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:02:37] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:02:37] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 8 (OVERLAPS) 0/578 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 449 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/579 variables, and 245 constraints, problems are : Problem set: 0 solved, 449 unsolved in 24644 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/578 variables, 162/184 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 449/694 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:02:59] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:03:01] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/579 variables, and 696 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 17/17 constraints]
After SMT, in 55027ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 55033ms
Starting structural reductions in SI_LTL mode, iteration 1 : 162/194 places, 456/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55590 ms. Remains : 162/194 places, 456/517 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-06 finished in 55682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X((G(F(p2))&&p1)))))))'
Support contains 6 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 190 transition count 507
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 190 transition count 507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 190 transition count 505
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 188 transition count 501
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 188 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 186 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 186 transition count 495
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 184 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 184 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 182 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 182 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 180 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 180 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 178 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 178 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 176 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 176 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 174 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 174 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 172 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 172 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 170 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 170 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 168 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 168 transition count 453
Applied a total of 54 rules in 26 ms. Remains 168 /194 variables (removed 26) and now considering 453/517 (removed 64) transitions.
[2024-06-02 23:03:19] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
// Phase 1: matrix 421 rows 168 cols
[2024-06-02 23:03:19] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:03:19] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-02 23:03:19] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
[2024-06-02 23:03:19] [INFO ] Invariant cache hit.
[2024-06-02 23:03:19] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:03:20] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 452 sub problems to find dead transitions.
[2024-06-02 23:03:20] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
[2024-06-02 23:03:20] [INFO ] Invariant cache hit.
[2024-06-02 23:03:20] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:03:23] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:03:23] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:03:23] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:03:23] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-02 23:03:24] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2024-06-02 23:03:24] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:03:24] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 2 ms to minimize.
[2024-06-02 23:03:24] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:03:24] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:03:24] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:03:25] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 420/588 variables, 168/186 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 60/246 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (OVERLAPS) 1/589 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 9 (OVERLAPS) 0/589 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 452 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 247 constraints, problems are : Problem set: 0 solved, 452 unsolved in 27744 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 420/588 variables, 168/186 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 60/246 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 452/698 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:04:04] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:04:05] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:04:17] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/589 variables, and 701 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 60/61 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 14/14 constraints]
After SMT, in 58105ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 58110ms
Starting structural reductions in LTL mode, iteration 1 : 168/194 places, 453/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58631 ms. Remains : 168/194 places, 453/517 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-09 finished in 58934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1&&(F(p3)||p2))))))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 186 transition count 503
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 186 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 186 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 184 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 184 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 182 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 182 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 180 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 180 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 178 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 178 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 176 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 174 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 174 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 172 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 172 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 171 transition count 465
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 171 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 170 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 170 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 169 transition count 461
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 169 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 168 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 168 transition count 459
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 165 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 162 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 162 transition count 456
Applied a total of 70 rules in 50 ms. Remains 162 /194 variables (removed 32) and now considering 456/517 (removed 61) transitions.
[2024-06-02 23:04:18] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 162 cols
[2024-06-02 23:04:18] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:04:18] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 23:04:18] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:04:18] [INFO ] Invariant cache hit.
[2024-06-02 23:04:18] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:04:18] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-06-02 23:04:18] [INFO ] Redundant transitions in 3 ms returned []
Running 449 sub problems to find dead transitions.
[2024-06-02 23:04:18] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:04:18] [INFO ] Invariant cache hit.
[2024-06-02 23:04:18] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:04:20] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:04:20] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:04:21] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2024-06-02 23:04:21] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:04:21] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:04:21] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:04:22] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:04:22] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:04:22] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/578 variables, 162/178 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:04:28] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:04:28] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:04:28] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:04:31] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:04:31] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (OVERLAPS) 0/578 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/579 variables, and 244 constraints, problems are : Problem set: 0 solved, 449 unsolved in 23726 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/578 variables, 162/183 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 449/693 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:04:50] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:05:08] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/579 variables, and 695 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 16/16 constraints]
After SMT, in 54194ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 54199ms
Starting structural reductions in SI_LTL mode, iteration 1 : 162/194 places, 456/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54617 ms. Remains : 162/194 places, 456/517 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-10
Product exploration explored 100000 steps with 5 reset in 264 ms.
Product exploration explored 100000 steps with 5 reset in 129 ms.
Computed a total of 24 stabilizing places and 65 stable transitions
Computed a total of 24 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2 p3), (X p2), (X p3), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 123 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter insensitive) to 2 states, 5 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (1291 resets) in 254 ms. (156 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (287 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
[2024-06-02 23:05:14] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:05:14] [INFO ] Invariant cache hit.
[2024-06-02 23:05:14] [INFO ] State equation strengthened by 61 read => feed constraints.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 4/579 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/162 constraints, ReadFeed: 0/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 26ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2 p3), (X p2), (X p3), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 (NOT p1) p3 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) p3 p2))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT p3)), (F (NOT p1)), (F (NOT (AND (OR p0 p1 p3) (OR p0 p3 p2))))]
Knowledge based reduction with 20 factoid took 300 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 456/456 transitions.
Applied a total of 0 rules in 6 ms. Remains 162 /162 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2024-06-02 23:05:14] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:05:14] [INFO ] Invariant cache hit.
[2024-06-02 23:05:14] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-02 23:05:14] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:05:14] [INFO ] Invariant cache hit.
[2024-06-02 23:05:14] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:05:14] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-06-02 23:05:15] [INFO ] Redundant transitions in 3 ms returned []
Running 449 sub problems to find dead transitions.
[2024-06-02 23:05:15] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:05:15] [INFO ] Invariant cache hit.
[2024-06-02 23:05:15] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:05:17] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:05:17] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:05:17] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:05:17] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:05:17] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:05:18] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:05:18] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:05:18] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-06-02 23:05:19] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/578 variables, 162/178 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:05:24] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:05:24] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-06-02 23:05:24] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:05:27] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:05:27] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (OVERLAPS) 0/578 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/579 variables, and 244 constraints, problems are : Problem set: 0 solved, 449 unsolved in 23545 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/578 variables, 162/183 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 449/693 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:05:46] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:06:04] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/579 variables, and 695 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 16/16 constraints]
After SMT, in 53979ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 53984ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54417 ms. Remains : 162/162 places, 456/456 transitions.
Computed a total of 24 stabilizing places and 65 stable transitions
Computed a total of 24 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 108 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (1273 resets) in 284 ms. (140 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (268 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (263 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (246 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (275 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (278 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
[2024-06-02 23:06:09] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:06:09] [INFO ] Invariant cache hit.
[2024-06-02 23:06:09] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 362/466 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 41/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 100/566 variables, 50/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 11/577 variables, 7/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/578 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/578 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/578 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/579 variables, and 230 constraints, problems are : Problem set: 0 solved, 5 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 362/466 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 41/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 100/566 variables, 50/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 5/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 11/577 variables, 7/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/577 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/578 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/578 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/578 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/579 variables, and 235 constraints, problems are : Problem set: 0 solved, 5 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1085ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 186 ms.
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 456/456 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 162 transition count 450
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 162 transition count 456
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 159 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 159 transition count 444
Applied a total of 24 rules in 27 ms. Remains 159 /162 variables (removed 3) and now considering 444/456 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 159/162 places, 444/456 transitions.
RANDOM walk for 40000 steps (1314 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (273 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (277 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 791245 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 2
Probabilistic random walk after 791245 steps, saw 191555 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2024-06-02 23:06:13] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 159 cols
[2024-06-02 23:06:13] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:06:13] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 355/457 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 97/554 variables, 49/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/565 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/566 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 355/457 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 97/554 variables, 49/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/565 variables, 7/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/566 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/566 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 444/444 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 159/159 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 444/444 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-06-02 23:06:14] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:06:14] [INFO ] Invariant cache hit.
[2024-06-02 23:06:14] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 23:06:14] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:06:14] [INFO ] Invariant cache hit.
[2024-06-02 23:06:14] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:06:14] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-06-02 23:06:14] [INFO ] Redundant transitions in 2 ms returned []
Running 438 sub problems to find dead transitions.
[2024-06-02 23:06:14] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:06:14] [INFO ] Invariant cache hit.
[2024-06-02 23:06:14] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:06:16] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:06:16] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:06:16] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:06:16] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-06-02 23:06:17] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:06:17] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:06:17] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:06:18] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:06:18] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:06:18] [INFO ] Deduced a trap composed of 103 places in 82 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/566 variables, 159/176 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 61/237 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:06:24] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:06:30] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:06:30] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:06:31] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:06:34] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 9 (OVERLAPS) 0/566 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 242 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/566 variables, 159/181 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 61/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 438/680 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 7 (OVERLAPS) 0/566 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 680 constraints, problems are : Problem set: 0 solved, 438 unsolved in 29575 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 15/15 constraints]
After SMT, in 59990ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 59997ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60356 ms. Remains : 159/159 places, 444/444 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
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 3 place count 133 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 290
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 14 place count 132 transition count 289
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 15 place count 132 transition count 288
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 17 place count 131 transition count 287
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 131 transition count 272
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 122 transition count 269
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 122 transition count 269
Applied a total of 44 rules in 23 ms. Remains 122 /159 variables (removed 37) and now considering 269/444 (removed 175) transitions.
Running SMT prover for 2 properties.
[2024-06-02 23:07:14] [INFO ] Flow matrix only has 267 transitions (discarded 2 similar events)
// Phase 1: matrix 267 rows 122 cols
[2024-06-02 23:07:14] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:07:14] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:07:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:07:14] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:07:15] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:07:15] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 248 ms.
Knowledge obtained : [(AND (NOT p0) p1 p3), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p3)), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 15 factoid took 280 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 84 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 6 reset in 90 ms.
Product exploration explored 100000 steps with 0 reset in 211 ms.
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 456/456 transitions.
Applied a total of 0 rules in 6 ms. Remains 162 /162 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2024-06-02 23:07:15] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 162 cols
[2024-06-02 23:07:15] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:07:16] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 23:07:16] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:07:16] [INFO ] Invariant cache hit.
[2024-06-02 23:07:16] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:07:16] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-06-02 23:07:16] [INFO ] Redundant transitions in 6 ms returned []
Running 449 sub problems to find dead transitions.
[2024-06-02 23:07:16] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:07:16] [INFO ] Invariant cache hit.
[2024-06-02 23:07:16] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:07:18] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:07:18] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:07:18] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:07:18] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:07:19] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:07:19] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:07:19] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:07:19] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:07:20] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/578 variables, 162/178 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:07:25] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:07:25] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:07:25] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:07:28] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:07:29] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (OVERLAPS) 0/578 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/579 variables, and 244 constraints, problems are : Problem set: 0 solved, 449 unsolved in 23975 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/578 variables, 162/183 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/244 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 449/693 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:07:48] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:08:06] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/579 variables, and 695 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 16/16 constraints]
After SMT, in 54364ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 54368ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54763 ms. Remains : 162/162 places, 456/456 transitions.
Treatment of property FireWire-PT-13-LTLFireability-10 finished in 232340 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((G((F(p2)&&p1))||p0)))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 185 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 185 transition count 500
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 185 transition count 498
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 182 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 182 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 179 transition count 483
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 179 transition count 483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 176 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 173 transition count 468
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 173 transition count 468
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 170 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 170 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 167 transition count 454
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 167 transition count 454
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 164 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 164 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 162 transition count 442
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 162 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 160 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 160 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 158 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 158 transition count 434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 157 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 157 transition count 432
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 154 transition count 429
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 152 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 152 transition count 429
Applied a total of 88 rules in 97 ms. Remains 152 /194 variables (removed 42) and now considering 429/517 (removed 88) transitions.
[2024-06-02 23:08:10] [INFO ] Flow matrix only has 393 transitions (discarded 36 similar events)
// Phase 1: matrix 393 rows 152 cols
[2024-06-02 23:08:10] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:08:11] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-02 23:08:11] [INFO ] Flow matrix only has 393 transitions (discarded 36 similar events)
[2024-06-02 23:08:11] [INFO ] Invariant cache hit.
[2024-06-02 23:08:11] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:08:11] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-06-02 23:08:11] [INFO ] Redundant transitions in 2 ms returned []
Running 422 sub problems to find dead transitions.
[2024-06-02 23:08:11] [INFO ] Flow matrix only has 393 transitions (discarded 36 similar events)
[2024-06-02 23:08:11] [INFO ] Invariant cache hit.
[2024-06-02 23:08:11] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 23:08:13] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 1 ms to minimize.
[2024-06-02 23:08:13] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:08:13] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:08:13] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:08:13] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 0 ms to minimize.
[2024-06-02 23:08:14] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:08:14] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:08:14] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:08:15] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 392/544 variables, 152/168 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 56/224 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 23:08:20] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:08:20] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:08:20] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:08:20] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 1 ms to minimize.
[2024-06-02 23:08:23] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 4 ms to minimize.
[2024-06-02 23:08:23] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (OVERLAPS) 0/544 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 422 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/545 variables, and 230 constraints, problems are : Problem set: 0 solved, 422 unsolved in 21490 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 23:08:35] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 392/544 variables, 152/175 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 56/231 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 422/653 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 23:08:46] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/545 variables, and 654 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 17/17 constraints]
After SMT, in 51869ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 51874ms
Starting structural reductions in SI_LTL mode, iteration 1 : 152/194 places, 429/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52621 ms. Remains : 152/194 places, 429/517 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-11
Product exploration explored 100000 steps with 5 reset in 81 ms.
Product exploration explored 100000 steps with 0 reset in 107 ms.
Computed a total of 13 stabilizing places and 38 stable transitions
Computed a total of 13 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 211 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (OR (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (1298 resets) in 163 ms. (243 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (20 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (34 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
[2024-06-02 23:09:04] [INFO ] Flow matrix only has 393 transitions (discarded 36 similar events)
[2024-06-02 23:09:04] [INFO ] Invariant cache hit.
[2024-06-02 23:09:04] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 94/545 variables, and 3 constraints, problems are : Problem set: 2 solved, 0 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 3/7 constraints, State Equation: 0/152 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (OR p0 (NOT p1))), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F p2), (F (NOT (OR p2 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 17 factoid took 234 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-13-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-13-LTLFireability-11 finished in 53868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 185 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 185 transition count 500
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 185 transition count 498
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 182 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 182 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 179 transition count 483
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 179 transition count 483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 176 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 173 transition count 468
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 173 transition count 468
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 170 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 170 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 167 transition count 454
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 167 transition count 454
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 164 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 164 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 162 transition count 442
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 162 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 160 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 160 transition count 438
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 159 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 159 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 158 transition count 434
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 158 transition count 434
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 155 transition count 431
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 152 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 152 transition count 431
Applied a total of 90 rules in 68 ms. Remains 152 /194 variables (removed 42) and now considering 431/517 (removed 86) transitions.
[2024-06-02 23:09:04] [INFO ] Flow matrix only has 392 transitions (discarded 39 similar events)
// Phase 1: matrix 392 rows 152 cols
[2024-06-02 23:09:04] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:09:05] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-06-02 23:09:05] [INFO ] Flow matrix only has 392 transitions (discarded 39 similar events)
[2024-06-02 23:09:05] [INFO ] Invariant cache hit.
[2024-06-02 23:09:05] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:09:05] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-06-02 23:09:05] [INFO ] Redundant transitions in 2 ms returned []
Running 424 sub problems to find dead transitions.
[2024-06-02 23:09:05] [INFO ] Flow matrix only has 392 transitions (discarded 39 similar events)
[2024-06-02 23:09:05] [INFO ] Invariant cache hit.
[2024-06-02 23:09:05] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-06-02 23:09:07] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:09:07] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:09:07] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:09:07] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:09:07] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2024-06-02 23:09:07] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:09:08] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:09:08] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:09:08] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:09:08] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:09:09] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-06-02 23:09:09] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 391/543 variables, 152/171 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-06-02 23:09:16] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 23:09:17] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 8 (OVERLAPS) 0/543 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/544 variables, and 229 constraints, problems are : Problem set: 0 solved, 424 unsolved in 20822 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 391/543 variables, 152/173 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 56/229 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 424/653 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-06-02 23:09:32] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:09:35] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/544 variables, and 655 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 16/16 constraints]
After SMT, in 51218ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 51225ms
Starting structural reductions in SI_LTL mode, iteration 1 : 152/194 places, 431/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51852 ms. Remains : 152/194 places, 431/517 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-13-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-12 finished in 51916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(F(G(p0)) U !p1)||F(X((G(p2)&&p3))))))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 190 transition count 507
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 190 transition count 507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 190 transition count 505
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 188 transition count 501
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 188 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 186 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 186 transition count 495
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 184 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 184 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 182 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 182 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 180 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 180 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 178 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 178 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 176 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 176 transition count 471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 175 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 175 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 174 transition count 466
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 174 transition count 466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 173 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 173 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 172 transition count 462
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 172 transition count 462
Applied a total of 46 rules in 19 ms. Remains 172 /194 variables (removed 22) and now considering 462/517 (removed 55) transitions.
[2024-06-02 23:09:56] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
// Phase 1: matrix 430 rows 172 cols
[2024-06-02 23:09:56] [INFO ] Computed 7 invariants in 10 ms
[2024-06-02 23:09:56] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-02 23:09:56] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 23:09:56] [INFO ] Invariant cache hit.
[2024-06-02 23:09:56] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 23:09:57] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-02 23:09:57] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 23:09:57] [INFO ] Invariant cache hit.
[2024-06-02 23:09:57] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:10:01] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:10:02] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:10:02] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 429/601 variables, 172/187 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 61/248 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (OVERLAPS) 1/602 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 9 (OVERLAPS) 0/602 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 249 constraints, problems are : Problem set: 0 solved, 461 unsolved in 28311 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 429/601 variables, 172/187 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 61/248 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 461/709 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-02 23:10:35] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:10:42] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 2/711 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/602 variables, and 711 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 61/62 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 10/10 constraints]
After SMT, in 58718ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 58724ms
Starting structural reductions in LTL mode, iteration 1 : 172/194 places, 462/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59182 ms. Remains : 172/194 places, 462/517 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 99 ms.
Product exploration explored 100000 steps with 2 reset in 134 ms.
Computed a total of 31 stabilizing places and 71 stable transitions
Computed a total of 31 stabilizing places and 71 stable transitions
Detected a total of 31/172 stabilizing places and 71/462 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X p3), (X (AND (NOT p1) p3 p2)), (X (NOT (OR (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT (AND p0 p1 p3 p2))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (AND p3 p2)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p3 p2))), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) p3 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p3 p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 41 factoid took 125 ms. Reduced automaton from 7 states, 29 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (1151 resets) in 569 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (26 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (27 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (21 resets) in 55 ms. (71 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (23 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (21 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (24 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (19 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (26 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (21 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (21 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (27 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (29 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (23 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (19 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (25 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (20 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (25 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 278878 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 23
Probabilistic random walk after 278878 steps, saw 67417 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2024-06-02 23:11:00] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 23:11:00] [INFO ] Invariant cache hit.
[2024-06-02 23:11:00] [INFO ] State equation strengthened by 62 read => feed constraints.
Problem apf7 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
Problem apf23 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 104/108 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 50/158 variables, 4/7 constraints. Problems are: Problem set: 4 solved, 19 unsolved
[2024-06-02 23:11:00] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:11:00] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 418/576 variables, 158/167 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 58/225 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/225 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 25/601 variables, 14/239 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 3/242 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/601 variables, 0/242 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 1/602 variables, 1/243 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/602 variables, 0/243 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/602 variables, 0/243 constraints. Problems are: Problem set: 4 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 243 constraints, problems are : Problem set: 4 solved, 19 unsolved in 1658 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 19 unsolved
Problem apf13 is UNSAT
Problem apf19 is UNSAT
At refinement iteration 1 (OVERLAPS) 104/108 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 50/158 variables, 4/7 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/9 constraints. Problems are: Problem set: 6 solved, 17 unsolved
[2024-06-02 23:11:02] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/10 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/10 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 418/576 variables, 158/168 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 58/226 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 8/234 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/234 constraints. Problems are: Problem set: 6 solved, 17 unsolved
Problem apf9 is UNSAT
At refinement iteration 11 (OVERLAPS) 25/601 variables, 14/248 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/601 variables, 3/251 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/601 variables, 8/259 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 0/259 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/602 variables, 1/260 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/602 variables, 0/260 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 0/602 variables, 0/260 constraints. Problems are: Problem set: 7 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 260 constraints, problems are : Problem set: 7 solved, 16 unsolved in 1794 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 16/23 constraints, Known Traps: 3/3 constraints]
After SMT, in 3486ms problems are : Problem set: 7 solved, 16 unsolved
Fused 16 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 462/462 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 172 transition count 459
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 172 transition count 456
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 169 transition count 456
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 167 transition count 454
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 164 transition count 460
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 25 place count 164 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 164 transition count 451
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 164 transition count 457
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 40 place count 161 transition count 451
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 161 transition count 445
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 160 transition count 444
Applied a total of 47 rules in 32 ms. Remains 160 /172 variables (removed 12) and now considering 444/462 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 160/172 places, 444/462 transitions.
RANDOM walk for 40000 steps (1241 resets) in 920 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (29 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (27 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (29 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (26 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (23 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (27 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (20 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (27 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (28 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (25 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (30 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (23 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (27 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (26 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 205635 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 16
Probabilistic random walk after 205635 steps, saw 57697 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-06-02 23:11:07] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 160 cols
[2024-06-02 23:11:07] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:11:07] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 356/459 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 97/556 variables, 50/196 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 10/566 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 1/567 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 0/567 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 227 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 356/459 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 97/556 variables, 50/196 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 16/235 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 10/566 variables, 6/241 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 23:11:09] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/567 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 244 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1902 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 2970ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 267 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 160/160 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-06-02 23:11:10] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:11:10] [INFO ] Invariant cache hit.
[2024-06-02 23:11:10] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:11:10] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:11:10] [INFO ] Invariant cache hit.
[2024-06-02 23:11:10] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:11:11] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-06-02 23:11:11] [INFO ] Redundant transitions in 2 ms returned []
Running 438 sub problems to find dead transitions.
[2024-06-02 23:11:11] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:11:11] [INFO ] Invariant cache hit.
[2024-06-02 23:11:11] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:11:12] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:11:13] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:11:13] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:11:13] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:11:13] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:11:13] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:11:13] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:11:13] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:11:13] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:11:14] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 0 ms to minimize.
[2024-06-02 23:11:15] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:11:15] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:11:15] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (OVERLAPS) 407/567 variables, 160/180 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:11:21] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:11:23] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:11:29] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 4 ms to minimize.
[2024-06-02 23:11:29] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 9 (OVERLAPS) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 244 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/567 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 60/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 438/682 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 7 (OVERLAPS) 0/567 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 682 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 17/17 constraints]
After SMT, in 60430ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 60435ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60883 ms. Remains : 160/160 places, 444/444 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
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 3 place count 134 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 134 transition count 290
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 14 place count 133 transition count 289
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 15 place count 133 transition count 288
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 17 place count 132 transition count 287
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 272
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 123 transition count 269
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 123 transition count 269
Applied a total of 44 rules in 19 ms. Remains 123 /160 variables (removed 37) and now considering 269/444 (removed 175) transitions.
Running SMT prover for 16 properties.
[2024-06-02 23:12:11] [INFO ] Flow matrix only has 267 transitions (discarded 2 similar events)
// Phase 1: matrix 267 rows 123 cols
[2024-06-02 23:12:11] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:12:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:12:11] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 23:12:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:12:12] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-06-02 23:12:12] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-02 23:12:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-06-02 23:12:12] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-02 23:12:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-06-02 23:12:12] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:12:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
TRAPS : Iteration 1
[2024-06-02 23:12:12] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:12:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
TRAPS : Iteration 2
[2024-06-02 23:12:12] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:12:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
TRAPS : Iteration 3
[2024-06-02 23:12:13] [INFO ] After 1601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2024-06-02 23:12:13] [INFO ] After 1871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Over-approximation ignoring read arcs solved 0 properties in 2053 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X p3), (X (AND (NOT p1) p3 p2)), (X (NOT (OR (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT (AND p0 p1 p3 p2))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (AND p3 p2)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p3 p2))), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) p3 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p3 p2)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (G (OR (NOT p0) p1 p2)), (G (OR (NOT p1) (NOT p3) (NOT p2))), (G (OR p1 p2)), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (AND (OR (NOT p0) p1 p3) (OR (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 48 factoid took 138 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[false, false, false]
Stuttering acceptance computed with spot in 117 ms :[false, false, false]
Support contains 3 out of 172 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 : 172/172 places, 462/462 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 171 transition count 458
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 168 transition count 458
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 166 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 163 transition count 462
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 22 place count 163 transition count 456
Applied a total of 22 rules in 21 ms. Remains 163 /172 variables (removed 9) and now considering 456/462 (removed 6) transitions.
[2024-06-02 23:12:14] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 163 cols
[2024-06-02 23:12:14] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:12:14] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 23:12:14] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:12:14] [INFO ] Invariant cache hit.
[2024-06-02 23:12:14] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:12:14] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-06-02 23:12:14] [INFO ] Redundant transitions in 4 ms returned []
Running 449 sub problems to find dead transitions.
[2024-06-02 23:12:14] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:12:14] [INFO ] Invariant cache hit.
[2024-06-02 23:12:14] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:12:16] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:12:16] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:12:16] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:12:16] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:12:17] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:12:17] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:12:17] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:12:17] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-06-02 23:12:17] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:12:18] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:12:18] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/579 variables, 163/181 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 60/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:12:29] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:12:30] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/579 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 8 (OVERLAPS) 0/579 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/580 variables, and 243 constraints, problems are : Problem set: 0 solved, 449 unsolved in 24124 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/579 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 60/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 449/692 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:12:50] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:12:56] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:13:07] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/580 variables, and 695 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 16/16 constraints]
After SMT, in 54504ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 54510ms
Starting structural reductions in SI_LTL mode, iteration 1 : 163/172 places, 456/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54928 ms. Remains : 163/172 places, 456/462 transitions.
Computed a total of 25 stabilizing places and 65 stable transitions
Computed a total of 25 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 140 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[false, false, false]
RANDOM walk for 40000 steps (1299 resets) in 553 ms. (72 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (282 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (295 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (274 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (272 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 532042 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 4
Probabilistic random walk after 532042 steps, saw 119702 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
[2024-06-02 23:13:12] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:13:12] [INFO ] Invariant cache hit.
[2024-06-02 23:13:12] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 361/465 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 101/566 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 12/578 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/579 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/579 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/579 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/580 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 361/465 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 101/566 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 12/578 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/579 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/579 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/579 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/580 variables, and 234 constraints, problems are : Problem set: 0 solved, 4 unsolved in 534 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 878ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 207 ms.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 456/456 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 450
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 8 place count 162 transition count 449
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 162 transition count 455
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 159 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 159 transition count 443
Applied a total of 26 rules in 19 ms. Remains 159 /163 variables (removed 4) and now considering 443/456 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 159/163 places, 443/456 transitions.
RANDOM walk for 40000 steps (1300 resets) in 505 ms. (79 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (269 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (271 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (282 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (287 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 444721 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 4
Probabilistic random walk after 444721 steps, saw 116442 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
[2024-06-02 23:13:17] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
// Phase 1: matrix 406 rows 159 cols
[2024-06-02 23:13:17] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:13:17] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 354/456 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/553 variables, 49/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 11/564 variables, 7/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/565 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 226 constraints, problems are : Problem set: 0 solved, 4 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 354/456 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/553 variables, 49/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 11/564 variables, 7/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/565 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/565 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 956ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 177 ms.
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 159/159 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2024-06-02 23:13:18] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 23:13:18] [INFO ] Invariant cache hit.
[2024-06-02 23:13:18] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 23:13:18] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 23:13:18] [INFO ] Invariant cache hit.
[2024-06-02 23:13:18] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:13:18] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-06-02 23:13:18] [INFO ] Redundant transitions in 6 ms returned []
Running 437 sub problems to find dead transitions.
[2024-06-02 23:13:18] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 23:13:18] [INFO ] Invariant cache hit.
[2024-06-02 23:13:18] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:13:20] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 2 ms to minimize.
[2024-06-02 23:13:20] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 4 ms to minimize.
[2024-06-02 23:13:20] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:13:20] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:13:21] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:13:21] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-02 23:13:21] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:13:21] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:13:21] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:13:22] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:13:22] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:13:22] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:13:24] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:13:24] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (OVERLAPS) 406/565 variables, 159/180 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:13:28] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:13:30] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:13:36] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:13:39] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 244 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 437 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:13:50] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (OVERLAPS) 406/565 variables, 159/185 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 60/245 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 437/682 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 437 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 682 constraints, problems are : Problem set: 0 solved, 437 unsolved in 29157 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 19/19 constraints]
After SMT, in 59529ms problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 59535ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59887 ms. Remains : 159/159 places, 443/443 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
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 3 place count 133 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 289
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 14 place count 132 transition count 288
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 15 place count 132 transition count 287
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 17 place count 131 transition count 286
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 131 transition count 271
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 122 transition count 268
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 122 transition count 268
Applied a total of 44 rules in 28 ms. Remains 122 /159 variables (removed 37) and now considering 268/443 (removed 175) transitions.
Running SMT prover for 4 properties.
[2024-06-02 23:14:18] [INFO ] Flow matrix only has 266 transitions (discarded 2 similar events)
// Phase 1: matrix 266 rows 122 cols
[2024-06-02 23:14:18] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:14:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:14:18] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:14:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:14:18] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 23:14:18] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-06-02 23:14:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
TRAPS : Iteration 1
[2024-06-02 23:14:18] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 23:14:18] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 488 ms.
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[false, false, false]
Stuttering acceptance computed with spot in 110 ms :[false, false, false]
Stuttering acceptance computed with spot in 130 ms :[false, false, false]
Product exploration explored 100000 steps with 5 reset in 54 ms.
Product exploration explored 100000 steps with 1 reset in 79 ms.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 456/456 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 455
Applied a total of 2 rules in 6 ms. Remains 162 /163 variables (removed 1) and now considering 455/456 (removed 1) transitions.
[2024-06-02 23:14:19] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
// Phase 1: matrix 416 rows 162 cols
[2024-06-02 23:14:19] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:14:19] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:14:19] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2024-06-02 23:14:19] [INFO ] Invariant cache hit.
[2024-06-02 23:14:19] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:14:19] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-06-02 23:14:19] [INFO ] Redundant transitions in 2 ms returned []
Running 448 sub problems to find dead transitions.
[2024-06-02 23:14:19] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2024-06-02 23:14:19] [INFO ] Invariant cache hit.
[2024-06-02 23:14:19] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 23:14:21] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:14:21] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:14:21] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:14:21] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-02 23:14:21] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:14:22] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:14:22] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-06-02 23:14:22] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:14:22] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 23:14:25] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 415/577 variables, 162/179 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 23:14:35] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:14:35] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/577 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 9 (OVERLAPS) 0/577 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/578 variables, and 241 constraints, problems are : Problem set: 0 solved, 448 unsolved in 26717 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (OVERLAPS) 415/577 variables, 162/181 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 60/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 448/689 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 23:14:52] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 23:15:06] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 691 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 14/14 constraints]
After SMT, in 57111ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 57117ms
Starting structural reductions in SI_LTL mode, iteration 1 : 162/163 places, 455/456 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57473 ms. Remains : 162/163 places, 455/456 transitions.
Treatment of property FireWire-PT-13-LTLFireability-13 finished in 320163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 185 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 185 transition count 500
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 185 transition count 498
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 182 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 182 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 179 transition count 483
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 179 transition count 483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 176 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 173 transition count 468
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 173 transition count 468
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 170 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 170 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 167 transition count 454
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 167 transition count 454
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 164 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 164 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 162 transition count 442
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 162 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 160 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 160 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 158 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 158 transition count 434
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 156 transition count 430
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 156 transition count 430
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 153 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 150 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 150 transition count 427
Applied a total of 94 rules in 42 ms. Remains 150 /194 variables (removed 44) and now considering 427/517 (removed 90) transitions.
[2024-06-02 23:15:16] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 150 cols
[2024-06-02 23:15:16] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:15:16] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 23:15:16] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:15:16] [INFO ] Invariant cache hit.
[2024-06-02 23:15:17] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:15:17] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-06-02 23:15:17] [INFO ] Redundant transitions in 4 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 23:15:17] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:15:17] [INFO ] Invariant cache hit.
[2024-06-02 23:15:17] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:15:18] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:15:19] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:15:19] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:15:19] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:15:19] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:15:19] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:15:19] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:15:19] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:15:20] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:15:20] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:15:20] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:15:20] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:15:21] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/170 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:15:28] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-06-02 23:15:28] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 0/537 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 228 constraints, problems are : Problem set: 0 solved, 420 unsolved in 20498 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/172 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 420/648 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:15:44] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 649 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 16/16 constraints]
After SMT, in 50848ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 50853ms
Starting structural reductions in SI_LTL mode, iteration 1 : 150/194 places, 427/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51270 ms. Remains : 150/194 places, 427/517 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-15
Product exploration explored 100000 steps with 1 reset in 44 ms.
Product exploration explored 100000 steps with 3 reset in 50 ms.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 35277 steps (1140 resets) in 104 ms. (335 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 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 427/427 transitions.
Applied a total of 0 rules in 15 ms. Remains 150 /150 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2024-06-02 23:16:08] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:16:08] [INFO ] Invariant cache hit.
[2024-06-02 23:16:08] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 23:16:08] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:16:08] [INFO ] Invariant cache hit.
[2024-06-02 23:16:08] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:16:08] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-06-02 23:16:08] [INFO ] Redundant transitions in 4 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 23:16:08] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:16:08] [INFO ] Invariant cache hit.
[2024-06-02 23:16:08] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:16:10] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-06-02 23:16:10] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:16:10] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:16:10] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:16:10] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:16:11] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-02 23:16:11] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:16:11] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:16:11] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:16:11] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:16:12] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:16:12] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:16:12] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/170 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:16:19] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-06-02 23:16:19] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 0/537 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 228 constraints, problems are : Problem set: 0 solved, 420 unsolved in 20668 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/172 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 420/648 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:16:36] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 649 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 16/16 constraints]
After SMT, in 50999ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 51003ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51379 ms. Remains : 150/150 places, 427/427 transitions.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 30545 steps (954 resets) in 81 ms. (372 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 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 48 ms.
Product exploration explored 100000 steps with 2 reset in 53 ms.
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 427/427 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2024-06-02 23:17:00] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:17:00] [INFO ] Invariant cache hit.
[2024-06-02 23:17:00] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 23:17:00] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:17:00] [INFO ] Invariant cache hit.
[2024-06-02 23:17:00] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:17:00] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-06-02 23:17:00] [INFO ] Redundant transitions in 4 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 23:17:00] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:17:00] [INFO ] Invariant cache hit.
[2024-06-02 23:17:00] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:17:02] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-06-02 23:17:02] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:17:02] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:17:02] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-06-02 23:17:02] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:17:03] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:17:03] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:17:03] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:17:03] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:17:03] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:17:04] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:17:04] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2024-06-02 23:17:04] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/170 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:17:11] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:17:11] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 0/537 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 228 constraints, problems are : Problem set: 0 solved, 420 unsolved in 20642 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/537 variables, 150/172 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 420/648 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:17:28] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 649 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 16/16 constraints]
After SMT, in 50950ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 50954ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51356 ms. Remains : 150/150 places, 427/427 transitions.
Treatment of property FireWire-PT-13-LTLFireability-15 finished in 155066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1&&(F(p3)||p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(F(G(p0)) U !p1)||F(X((G(p2)&&p3))))))'
Found a Shortening insensitive property : FireWire-PT-13-LTLFireability-13
Stuttering acceptance computed with spot in 415 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 186 transition count 503
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 186 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 186 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 184 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 184 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 182 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 182 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 180 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 180 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 178 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 178 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 176 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 174 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 174 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 172 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 172 transition count 467
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 171 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 171 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 170 transition count 462
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 170 transition count 462
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 169 transition count 460
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 169 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 168 transition count 458
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 168 transition count 458
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 166 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 163 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 163 transition count 459
Applied a total of 65 rules in 53 ms. Remains 163 /194 variables (removed 31) and now considering 459/517 (removed 58) transitions.
[2024-06-02 23:17:52] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
// Phase 1: matrix 420 rows 163 cols
[2024-06-02 23:17:52] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:17:52] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 23:17:52] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
[2024-06-02 23:17:52] [INFO ] Invariant cache hit.
[2024-06-02 23:17:52] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:17:53] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 452 sub problems to find dead transitions.
[2024-06-02 23:17:53] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
[2024-06-02 23:17:53] [INFO ] Invariant cache hit.
[2024-06-02 23:17:53] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:17:54] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-06-02 23:17:55] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:17:55] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-06-02 23:17:55] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:17:55] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:17:55] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:17:56] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-06-02 23:17:56] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:17:56] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 419/582 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:18:04] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:18:04] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:18:06] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 8 (OVERLAPS) 0/582 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 452 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/583 variables, and 242 constraints, problems are : Problem set: 0 solved, 452 unsolved in 24204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 419/582 variables, 163/182 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 60/242 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 452/694 constraints. Problems are: Problem set: 0 solved, 452 unsolved
[2024-06-02 23:18:23] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2024-06-02 23:18:25] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/583 variables, and 696 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 14/14 constraints]
After SMT, in 54598ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 54605ms
Starting structural reductions in LI_LTL mode, iteration 1 : 163/194 places, 459/517 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 55053 ms. Remains : 163/194 places, 459/517 transitions.
Running random walk in product with property : FireWire-PT-13-LTLFireability-13
Product exploration explored 100000 steps with 3 reset in 85 ms.
Product exploration explored 100000 steps with 3 reset in 95 ms.
Computed a total of 25 stabilizing places and 65 stable transitions
Computed a total of 25 stabilizing places and 65 stable transitions
Detected a total of 25/163 stabilizing places and 65/459 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X p3), (X (AND (NOT p1) p3 p2)), (X (NOT (OR (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT (AND p0 p1 p3 p2))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (AND p3 p2)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p3 p2))), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) p3 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p3 p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 41 factoid took 144 ms. Reduced automaton from 7 states, 29 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (1286 resets) in 362 ms. (110 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 54 ms. (72 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (25 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (27 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (25 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (26 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (27 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (24 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (26 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (29 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (25 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (26 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (29 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (27 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (27 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (31 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (21 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (25 resets) in 44 ms. (88 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (25 resets) in 58 ms. (67 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 173367 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 23
Probabilistic random walk after 173367 steps, saw 43428 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-06-02 23:18:51] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
[2024-06-02 23:18:51] [INFO ] Invariant cache hit.
[2024-06-02 23:18:51] [INFO ] State equation strengthened by 60 read => feed constraints.
Problem apf7 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
Problem apf23 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 366/471 variables, 105/108 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 40/148 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 0/148 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 100/571 variables, 51/199 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 3/202 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 20/222 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 0/222 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 10/581 variables, 6/228 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 1/229 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 0/229 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 1/582 variables, 1/230 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/230 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 0/582 variables, 0/230 constraints. Problems are: Problem set: 4 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/583 variables, and 230 constraints, problems are : Problem set: 4 solved, 19 unsolved in 1837 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 19 unsolved
Problem apf13 is UNSAT
Problem apf19 is UNSAT
At refinement iteration 1 (OVERLAPS) 101/105 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 366/471 variables, 105/108 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 40/148 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 0/148 constraints. Problems are: Problem set: 6 solved, 17 unsolved
Problem apf9 is UNSAT
At refinement iteration 6 (OVERLAPS) 100/571 variables, 51/199 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 3/202 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 20/222 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 16/238 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 0/238 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 10/581 variables, 6/244 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 1/245 constraints. Problems are: Problem set: 7 solved, 16 unsolved
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 1/246 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/246 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/582 variables, 1/247 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/247 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 0/582 variables, 0/247 constraints. Problems are: Problem set: 7 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/583 variables, and 247 constraints, problems are : Problem set: 7 solved, 16 unsolved in 1991 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/23 constraints, Known Traps: 1/1 constraints]
After SMT, in 3860ms problems are : Problem set: 7 solved, 16 unsolved
Fused 16 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 158 ms.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 459/459 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 163 transition count 450
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 163 transition count 456
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 21 place count 160 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 160 transition count 444
Applied a total of 27 rules in 19 ms. Remains 160 /163 variables (removed 3) and now considering 444/459 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 160/163 places, 444/459 transitions.
RANDOM walk for 40000 steps (1256 resets) in 1463 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (31 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (25 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (25 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (26 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (28 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (25 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (32 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (24 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (27 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (25 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (28 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (26 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (26 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 181166 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 16
Probabilistic random walk after 181166 steps, saw 51776 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-06-02 23:18:59] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 160 cols
[2024-06-02 23:18:59] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 23:18:59] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 356/459 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 97/556 variables, 50/196 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 10/566 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 1/567 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 0/567 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 227 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 356/459 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 97/556 variables, 50/196 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 16/235 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 10/566 variables, 6/241 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 23:19:01] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/567 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 244 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2044 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 3173ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 155 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 160/160 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-06-02 23:19:02] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:19:02] [INFO ] Invariant cache hit.
[2024-06-02 23:19:02] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 23:19:02] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:19:02] [INFO ] Invariant cache hit.
[2024-06-02 23:19:03] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:19:03] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2024-06-02 23:19:03] [INFO ] Redundant transitions in 3 ms returned []
Running 438 sub problems to find dead transitions.
[2024-06-02 23:19:03] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:19:03] [INFO ] Invariant cache hit.
[2024-06-02 23:19:03] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:19:05] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:19:05] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:19:05] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:19:05] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:19:05] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:19:05] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:19:05] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-02 23:19:06] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:19:06] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:19:06] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:19:07] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:19:07] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:19:07] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (OVERLAPS) 407/567 variables, 160/180 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:19:13] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:19:15] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:19:22] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:19:22] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 9 (OVERLAPS) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 244 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/567 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 60/244 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 438/682 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 7 (OVERLAPS) 0/567 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 682 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 17/17 constraints]
After SMT, in 60417ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 60423ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60861 ms. Remains : 160/160 places, 444/444 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
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 3 place count 134 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 134 transition count 290
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 14 place count 133 transition count 289
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 15 place count 133 transition count 288
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 17 place count 132 transition count 287
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 272
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 123 transition count 269
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 123 transition count 269
Applied a total of 44 rules in 19 ms. Remains 123 /160 variables (removed 37) and now considering 269/444 (removed 175) transitions.
Running SMT prover for 16 properties.
[2024-06-02 23:20:03] [INFO ] Flow matrix only has 267 transitions (discarded 2 similar events)
// Phase 1: matrix 267 rows 123 cols
[2024-06-02 23:20:03] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:20:03] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:20:03] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 23:20:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:20:04] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-06-02 23:20:04] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-06-02 23:20:04] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-06-02 23:20:04] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
TRAPS : Iteration 1
[2024-06-02 23:20:04] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
TRAPS : Iteration 2
[2024-06-02 23:20:05] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 0 ms to minimize.
[2024-06-02 23:20:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
TRAPS : Iteration 3
[2024-06-02 23:20:05] [INFO ] After 1601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2024-06-02 23:20:05] [INFO ] After 1875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Over-approximation ignoring read arcs solved 0 properties in 2095 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X p3), (X (AND (NOT p1) p3 p2)), (X (NOT (OR (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT (AND p0 p1 p3 p2))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (AND p3 p2)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p3 p2))), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) p3 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p3 p2)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (G (OR (NOT p0) p1 p2)), (G (OR (NOT p1) (NOT p3) (NOT p2))), (G (OR p1 p2)), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (AND (OR (NOT p0) p1 p3) (OR (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 48 factoid took 155 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[false, false, false]
Stuttering acceptance computed with spot in 123 ms :[false, false, false]
Support contains 3 out of 163 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 : 163/163 places, 459/459 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 456
Applied a total of 3 rules in 13 ms. Remains 163 /163 variables (removed 0) and now considering 456/459 (removed 3) transitions.
[2024-06-02 23:20:06] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 163 cols
[2024-06-02 23:20:06] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:20:06] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 23:20:06] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:20:06] [INFO ] Invariant cache hit.
[2024-06-02 23:20:06] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:20:06] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-06-02 23:20:06] [INFO ] Redundant transitions in 6 ms returned []
Running 449 sub problems to find dead transitions.
[2024-06-02 23:20:06] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:20:06] [INFO ] Invariant cache hit.
[2024-06-02 23:20:06] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:20:08] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:20:08] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:20:08] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 3 ms to minimize.
[2024-06-02 23:20:08] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:20:09] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:20:09] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:20:09] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:20:09] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:20:09] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:20:10] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-06-02 23:20:10] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/579 variables, 163/181 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 60/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:20:22] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2024-06-02 23:20:22] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/579 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 8 (OVERLAPS) 0/579 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/580 variables, and 243 constraints, problems are : Problem set: 0 solved, 449 unsolved in 24457 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (OVERLAPS) 416/579 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 60/243 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 449/692 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:20:43] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:20:49] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:21:00] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/580 variables, and 695 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 16/16 constraints]
After SMT, in 54867ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 54873ms
Starting structural reductions in SI_LTL mode, iteration 1 : 163/163 places, 456/459 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55284 ms. Remains : 163/163 places, 456/459 transitions.
Computed a total of 25 stabilizing places and 65 stable transitions
Computed a total of 25 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 124 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[false, false, false]
RANDOM walk for 40000 steps (1275 resets) in 530 ms. (75 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (273 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (309 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (285 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (276 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 441404 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 4
Probabilistic random walk after 441404 steps, saw 104570 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2024-06-02 23:21:05] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:21:05] [INFO ] Invariant cache hit.
[2024-06-02 23:21:05] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 361/465 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 101/566 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 12/578 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/579 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/579 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/579 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/580 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 361/465 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 101/566 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 12/578 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/579 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/579 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/579 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/580 variables, and 234 constraints, problems are : Problem set: 0 solved, 4 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 927ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 294 ms.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 456/456 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 450
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 8 place count 162 transition count 449
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 162 transition count 455
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 159 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 159 transition count 443
Applied a total of 26 rules in 43 ms. Remains 159 /163 variables (removed 4) and now considering 443/456 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 159/163 places, 443/456 transitions.
RANDOM walk for 40000 steps (1255 resets) in 349 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (284 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (298 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (267 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (281 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 398732 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 4
Probabilistic random walk after 398732 steps, saw 106826 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
[2024-06-02 23:21:09] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
// Phase 1: matrix 406 rows 159 cols
[2024-06-02 23:21:09] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:21:09] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 354/456 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/553 variables, 49/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 11/564 variables, 7/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/565 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/565 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 226 constraints, problems are : Problem set: 0 solved, 4 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 354/456 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/553 variables, 49/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 11/564 variables, 7/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/565 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/565 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 978ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 286 ms.
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 159/159 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2024-06-02 23:21:11] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 23:21:11] [INFO ] Invariant cache hit.
[2024-06-02 23:21:11] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 23:21:11] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 23:21:11] [INFO ] Invariant cache hit.
[2024-06-02 23:21:11] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:21:11] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-06-02 23:21:11] [INFO ] Redundant transitions in 2 ms returned []
Running 437 sub problems to find dead transitions.
[2024-06-02 23:21:11] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 23:21:11] [INFO ] Invariant cache hit.
[2024-06-02 23:21:11] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:21:13] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:21:13] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:21:13] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:21:13] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:21:14] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:21:14] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2024-06-02 23:21:14] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:21:14] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-02 23:21:14] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:21:15] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:21:15] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:21:15] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:21:17] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:21:17] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (OVERLAPS) 406/565 variables, 159/180 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:21:21] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:21:24] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:21:29] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:21:33] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 244 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 437 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:21:43] [INFO ] Deduced a trap composed of 94 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (OVERLAPS) 406/565 variables, 159/185 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 60/245 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 437/682 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 437 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 682 constraints, problems are : Problem set: 0 solved, 437 unsolved in 29512 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 19/19 constraints]
After SMT, in 59934ms problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 59937ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60308 ms. Remains : 159/159 places, 443/443 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
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 3 place count 133 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 289
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 14 place count 132 transition count 288
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 15 place count 132 transition count 287
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 17 place count 131 transition count 286
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 131 transition count 271
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 122 transition count 268
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 122 transition count 268
Applied a total of 44 rules in 16 ms. Remains 122 /159 variables (removed 37) and now considering 268/443 (removed 175) transitions.
Running SMT prover for 4 properties.
[2024-06-02 23:22:11] [INFO ] Flow matrix only has 266 transitions (discarded 2 similar events)
// Phase 1: matrix 266 rows 122 cols
[2024-06-02 23:22:11] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:22:11] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:22:11] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:22:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:22:11] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 23:22:11] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-02 23:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 1
[2024-06-02 23:22:11] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 23:22:11] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 471 ms.
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[false, false, false]
Stuttering acceptance computed with spot in 138 ms :[false, false, false]
Stuttering acceptance computed with spot in 131 ms :[false, false, false]
Product exploration explored 100000 steps with 3 reset in 49 ms.
Product exploration explored 100000 steps with 23 reset in 56 ms.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 456/456 transitions.
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 2 place count 162 transition count 455
Applied a total of 2 rules in 7 ms. Remains 162 /163 variables (removed 1) and now considering 455/456 (removed 1) transitions.
[2024-06-02 23:22:12] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
// Phase 1: matrix 416 rows 162 cols
[2024-06-02 23:22:12] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:22:12] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 23:22:12] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2024-06-02 23:22:12] [INFO ] Invariant cache hit.
[2024-06-02 23:22:12] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:22:12] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-06-02 23:22:12] [INFO ] Redundant transitions in 6 ms returned []
Running 448 sub problems to find dead transitions.
[2024-06-02 23:22:12] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2024-06-02 23:22:12] [INFO ] Invariant cache hit.
[2024-06-02 23:22:12] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 23:22:14] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:22:14] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 0 ms to minimize.
[2024-06-02 23:22:15] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:22:15] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:22:15] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:22:15] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:22:15] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:22:16] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:22:16] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 23:22:18] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 415/577 variables, 162/179 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 23:22:29] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:22:29] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/577 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 9 (OVERLAPS) 0/577 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/578 variables, and 241 constraints, problems are : Problem set: 0 solved, 448 unsolved in 26864 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (OVERLAPS) 415/577 variables, 162/181 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 60/241 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 448/689 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 23:22:46] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 23:23:00] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 691 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 14/14 constraints]
After SMT, in 57283ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 57289ms
Starting structural reductions in SI_LTL mode, iteration 1 : 162/163 places, 455/456 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57658 ms. Remains : 162/163 places, 455/456 transitions.
Treatment of property FireWire-PT-13-LTLFireability-13 finished in 318191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-02 23:23:10] [INFO ] Flatten gal took : 28 ms
[2024-06-02 23:23:10] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-02 23:23:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 194 places, 517 transitions and 1926 arcs took 8 ms.
Total runtime 1558017 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-13

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 194
TRANSITIONS: 517
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.008s]


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


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

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

Process ID: 3135
MODEL NAME: /home/mcc/execution/414/model
194 places, 517 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-13-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-13-LTLFireability-10 CANNOT_COMPUTE
FORMULA FireWire-PT-13-LTLFireability-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717371130594

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

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

MEDDLY ERROR: Insufficient memory

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-13.tgz
mv FireWire-PT-13 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;