Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 84K 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-01-LTLFireability-00
FORMULA_NAME FireWire-PT-01-LTLFireability-01
FORMULA_NAME FireWire-PT-01-LTLFireability-02
FORMULA_NAME FireWire-PT-01-LTLFireability-03
FORMULA_NAME FireWire-PT-01-LTLFireability-04
FORMULA_NAME FireWire-PT-01-LTLFireability-05
FORMULA_NAME FireWire-PT-01-LTLFireability-06
FORMULA_NAME FireWire-PT-01-LTLFireability-07
FORMULA_NAME FireWire-PT-01-LTLFireability-08
FORMULA_NAME FireWire-PT-01-LTLFireability-09
FORMULA_NAME FireWire-PT-01-LTLFireability-10
FORMULA_NAME FireWire-PT-01-LTLFireability-11
FORMULA_NAME FireWire-PT-01-LTLFireability-12
FORMULA_NAME FireWire-PT-01-LTLFireability-13
FORMULA_NAME FireWire-PT-01-LTLFireability-14
FORMULA_NAME FireWire-PT-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717353243141

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:34:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:34:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:34:04] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 18:34:04] [INFO ] Transformed 107 places.
[2024-06-02 18:34:04] [INFO ] Transformed 346 transitions.
[2024-06-02 18:34:04] [INFO ] Found NUPN structural information;
[2024-06-02 18:34:04] [INFO ] Parsed PT model containing 107 places and 346 transitions and 1271 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-01-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 293/293 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 104 transition count 285
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 104 transition count 285
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 102 transition count 281
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 102 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 102 transition count 275
Applied a total of 16 rules in 57 ms. Remains 102 /107 variables (removed 5) and now considering 275/293 (removed 18) transitions.
[2024-06-02 18:34:04] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
// Phase 1: matrix 249 rows 102 cols
[2024-06-02 18:34:04] [INFO ] Computed 8 invariants in 15 ms
[2024-06-02 18:34:05] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-06-02 18:34:05] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2024-06-02 18:34:05] [INFO ] Invariant cache hit.
[2024-06-02 18:34:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 18:34:05] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [100]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 534 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/107 places, 275/293 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 612 ms. Remains : 101/107 places, 275/293 transitions.
Support contains 24 out of 101 places after structural reductions.
[2024-06-02 18:34:05] [INFO ] Flatten gal took : 64 ms
[2024-06-02 18:34:05] [INFO ] Flatten gal took : 37 ms
[2024-06-02 18:34:05] [INFO ] Input system was already deterministic with 275 transitions.
RANDOM walk for 40000 steps (2189 resets) in 1947 ms. (20 steps per ms) remains 4/16 properties
BEST_FIRST walk for 40004 steps (576 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1096 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (72 resets) in 62 ms. (634 steps per ms) remains 3/4 properties
[2024-06-02 18:34:06] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
// Phase 1: matrix 249 rows 101 cols
[2024-06-02 18:34:06] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:34:06] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/97 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 245/342 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/346 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/349 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/350 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/350 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 146 constraints, problems are : Problem set: 0 solved, 3 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/97 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 245/342 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/346 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/349 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/349 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/350 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/350 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/350 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 149 constraints, problems are : Problem set: 0 solved, 3 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 967ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 517 ms.
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 275/275 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 101 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 100 transition count 271
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 100 transition count 270
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 99 transition count 270
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
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 13 place count 96 transition count 277
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 19 place count 96 transition count 271
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 22 place count 96 transition count 268
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 96 transition count 271
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 29 place count 94 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 94 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 93 transition count 265
Applied a total of 32 rules in 74 ms. Remains 93 /101 variables (removed 8) and now considering 265/275 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 93/101 places, 265/275 transitions.
RANDOM walk for 40000 steps (2610 resets) in 1010 ms. (39 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (636 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1441 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (57 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 18521 steps, run visited all 3 properties in 95 ms. (steps per millisecond=194 )
Probabilistic random walk after 18521 steps, saw 7015 distinct states, run finished after 101 ms. (steps per millisecond=183 ) properties seen :3
FORMULA FireWire-PT-01-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 7 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(X(X(p0))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 270
Applied a total of 4 rules in 8 ms. Remains 99 /101 variables (removed 2) and now considering 270/275 (removed 5) transitions.
[2024-06-02 18:34:08] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 18:34:08] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:34:08] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:34:08] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:34:09] [INFO ] Invariant cache hit.
[2024-06-02 18:34:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:34:09] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 18:34:09] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:34:09] [INFO ] Invariant cache hit.
[2024-06-02 18:34:09] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 18:34:10] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 8 ms to minimize.
[2024-06-02 18:34:10] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:34:10] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:34:10] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:34:10] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-06-02 18:34:11] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:34:11] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:34:11] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:34:11] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:34:11] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-02 18:34:11] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10420 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14591 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 25236ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 25241ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 270/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25460 ms. Remains : 99/101 places, 270/275 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-01-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-01-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-00 finished in 25851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(G(p0))))||F(((p2||X(p0))&&p1))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 270
Applied a total of 4 rules in 10 ms. Remains 99 /101 variables (removed 2) and now considering 270/275 (removed 5) transitions.
[2024-06-02 18:34:34] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:34:34] [INFO ] Invariant cache hit.
[2024-06-02 18:34:34] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 18:34:34] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:34:34] [INFO ] Invariant cache hit.
[2024-06-02 18:34:34] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:34:34] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 18:34:34] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:34:34] [INFO ] Invariant cache hit.
[2024-06-02 18:34:34] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 18:34:36] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:34:36] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:34:36] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:34:36] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:34:36] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:34:36] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:34:36] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:34:36] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:34:36] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:34:37] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:34:37] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10055 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 15007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 25244ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 25251ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 270/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25450 ms. Remains : 99/101 places, 270/275 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FireWire-PT-01-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-01-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-01 finished in 25710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 99 transition count 272
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 98 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 97 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 97 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 96 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 96 transition count 267
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
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 14 place count 93 transition count 274
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 20 place count 93 transition count 268
Applied a total of 20 rules in 32 ms. Remains 93 /101 variables (removed 8) and now considering 268/275 (removed 7) transitions.
[2024-06-02 18:35:00] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 93 cols
[2024-06-02 18:35:00] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:35:00] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:35:00] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:35:00] [INFO ] Invariant cache hit.
[2024-06-02 18:35:00] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:35:00] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-06-02 18:35:00] [INFO ] Redundant transitions in 14 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 18:35:00] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:35:00] [INFO ] Invariant cache hit.
[2024-06-02 18:35:00] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 18:35:01] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:35:01] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:35:01] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 0 ms to minimize.
[2024-06-02 18:35:01] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:35:01] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-06-02 18:35:01] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:35:01] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:35:02] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/107 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 18:35:04] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 146 constraints, problems are : Problem set: 0 solved, 265 unsolved in 10761 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 265/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/328 variables, and 411 constraints, problems are : Problem set: 0 solved, 265 unsolved in 13417 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 24350ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 24353ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/101 places, 268/275 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24637 ms. Remains : 93/101 places, 268/275 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-01-LTLFireability-02
Product exploration explored 100000 steps with 3 reset in 215 ms.
Product exploration explored 100000 steps with 0 reset in 90 ms.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2535 resets) in 357 ms. (111 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1442 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
[2024-06-02 18:35:25] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:35:25] [INFO ] Invariant cache hit.
[2024-06-02 18:35:25] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 186/235 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 85/320 variables, 39/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/327 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/327 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 186/235 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 85/320 variables, 39/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/327 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/327 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/328 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 263ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 268/268 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 93 transition count 262
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 93 transition count 265
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 91 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 91 transition count 260
Applied a total of 15 rules in 26 ms. Remains 91 /93 variables (removed 2) and now considering 260/268 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 91/93 places, 260/268 transitions.
RANDOM walk for 40000 steps (2510 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1458 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5210 steps, run visited all 1 properties in 14 ms. (steps per millisecond=372 )
Probabilistic random walk after 5210 steps, saw 2556 distinct states, run finished after 14 ms. (steps per millisecond=372 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 360 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 268/268 transitions.
Applied a total of 0 rules in 11 ms. Remains 93 /93 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-06-02 18:35:26] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:35:26] [INFO ] Invariant cache hit.
[2024-06-02 18:35:26] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 18:35:26] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:35:26] [INFO ] Invariant cache hit.
[2024-06-02 18:35:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:35:26] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-06-02 18:35:26] [INFO ] Redundant transitions in 3 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 18:35:26] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:35:26] [INFO ] Invariant cache hit.
[2024-06-02 18:35:26] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 18:35:27] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:35:27] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:35:27] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:35:27] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 4 ms to minimize.
[2024-06-02 18:35:28] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:35:28] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:35:28] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:35:28] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/107 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 18:35:30] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 146 constraints, problems are : Problem set: 0 solved, 265 unsolved in 10899 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 265/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/328 variables, and 411 constraints, problems are : Problem set: 0 solved, 265 unsolved in 13637 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 24707ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 24711ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24990 ms. Remains : 93/93 places, 268/268 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2554 resets) in 184 ms. (216 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (1516 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
[2024-06-02 18:35:51] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:35:51] [INFO ] Invariant cache hit.
[2024-06-02 18:35:51] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 186/235 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 85/320 variables, 39/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/327 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/327 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 186/235 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 85/320 variables, 39/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/327 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/327 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/328 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 231ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 268/268 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 93 transition count 262
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 93 transition count 265
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 91 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 91 transition count 260
Applied a total of 15 rules in 19 ms. Remains 91 /93 variables (removed 2) and now considering 260/268 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 91/93 places, 260/268 transitions.
RANDOM walk for 40000 steps (2531 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1457 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5210 steps, run visited all 1 properties in 12 ms. (steps per millisecond=434 )
Probabilistic random walk after 5210 steps, saw 2556 distinct states, run finished after 12 ms. (steps per millisecond=434 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 241 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 163 ms.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 268/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-06-02 18:35:52] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:35:52] [INFO ] Invariant cache hit.
[2024-06-02 18:35:52] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 18:35:52] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:35:52] [INFO ] Invariant cache hit.
[2024-06-02 18:35:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:35:53] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-06-02 18:35:53] [INFO ] Redundant transitions in 2 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 18:35:53] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:35:53] [INFO ] Invariant cache hit.
[2024-06-02 18:35:53] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 18:35:53] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:35:53] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:35:54] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:35:54] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:35:54] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:35:54] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:35:54] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:35:54] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/107 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 18:35:57] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 146 constraints, problems are : Problem set: 0 solved, 265 unsolved in 10955 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 265/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/328 variables, and 411 constraints, problems are : Problem set: 0 solved, 265 unsolved in 13594 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 24700ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 24703ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24963 ms. Remains : 93/93 places, 268/268 transitions.
Treatment of property FireWire-PT-01-LTLFireability-02 finished in 77382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 99 transition count 272
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 98 transition count 272
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
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 10 place count 95 transition count 279
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 16 place count 95 transition count 273
Applied a total of 16 rules in 19 ms. Remains 95 /101 variables (removed 6) and now considering 273/275 (removed 2) transitions.
[2024-06-02 18:36:17] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
// Phase 1: matrix 240 rows 95 cols
[2024-06-02 18:36:17] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:36:17] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:36:17] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 18:36:17] [INFO ] Invariant cache hit.
[2024-06-02 18:36:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 18:36:18] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-06-02 18:36:18] [INFO ] Redundant transitions in 2 ms returned []
Running 270 sub problems to find dead transitions.
[2024-06-02 18:36:18] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 18:36:18] [INFO ] Invariant cache hit.
[2024-06-02 18:36:18] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 18:36:18] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:36:18] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:36:18] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:36:19] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:36:19] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:36:19] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-02 18:36:19] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 239/333 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 38/146 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 18:36:22] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/335 variables, and 148 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11315 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 239/333 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 38/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 270/417 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/335 variables, and 418 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15571 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 8/8 constraints]
After SMT, in 27059ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 27062ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/101 places, 273/275 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27259 ms. Remains : 95/101 places, 273/275 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-03 finished in 27351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 99 transition count 272
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 98 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 97 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 97 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 96 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 96 transition count 267
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
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 14 place count 93 transition count 274
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 20 place count 93 transition count 268
Applied a total of 20 rules in 24 ms. Remains 93 /101 variables (removed 8) and now considering 268/275 (removed 7) transitions.
[2024-06-02 18:36:45] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 93 cols
[2024-06-02 18:36:45] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:36:45] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-06-02 18:36:45] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:36:45] [INFO ] Invariant cache hit.
[2024-06-02 18:36:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:36:45] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-06-02 18:36:45] [INFO ] Redundant transitions in 1 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 18:36:45] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 18:36:45] [INFO ] Invariant cache hit.
[2024-06-02 18:36:45] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 18:36:46] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:36:46] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:36:46] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:36:46] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:36:46] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:36:46] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:36:46] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:36:47] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/107 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 18:36:49] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 146 constraints, problems are : Problem set: 0 solved, 265 unsolved in 10739 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 265/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/328 variables, and 411 constraints, problems are : Problem set: 0 solved, 265 unsolved in 13665 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 24565ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 24571ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/101 places, 268/275 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25060 ms. Remains : 93/101 places, 268/275 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-01-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-05 finished in 25207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p1)&&p0))))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 270
Applied a total of 4 rules in 5 ms. Remains 99 /101 variables (removed 2) and now considering 270/275 (removed 5) transitions.
[2024-06-02 18:37:10] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 18:37:10] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:37:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:37:10] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:37:10] [INFO ] Invariant cache hit.
[2024-06-02 18:37:10] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:37:10] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 18:37:10] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:37:10] [INFO ] Invariant cache hit.
[2024-06-02 18:37:10] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 18:37:11] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:37:11] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:37:12] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:37:12] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:37:12] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:37:12] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-06-02 18:37:12] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2024-06-02 18:37:12] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:37:12] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:37:12] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:37:12] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 9853 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14761 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24774ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24778ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 270/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24964 ms. Remains : 99/101 places, 270/275 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-07
Product exploration explored 100000 steps with 1 reset in 87 ms.
Product exploration explored 100000 steps with 2 reset in 89 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (2174 resets) in 70 ms. (563 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
[2024-06-02 18:37:36] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:37:36] [INFO ] Invariant cache hit.
[2024-06-02 18:37:36] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/95 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/335 variables, 95/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 35/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/339 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/342 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/343 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/343 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/343 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/95 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/335 variables, 95/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 35/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/339 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/342 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/343 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/343 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/343 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 242ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 270/270 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 98 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 98 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 97 transition count 265
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
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 13 place count 94 transition count 272
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 19 place count 94 transition count 266
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 22 place count 94 transition count 263
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 94 transition count 266
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 29 place count 92 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 92 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 91 transition count 260
Applied a total of 32 rules in 27 ms. Remains 91 /99 variables (removed 8) and now considering 260/270 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 91/99 places, 260/270 transitions.
RANDOM walk for 35663 steps (2281 resets) in 76 ms. (463 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 198 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2024-06-02 18:37:36] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:37:36] [INFO ] Invariant cache hit.
[2024-06-02 18:37:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:37:37] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 18:37:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:37:37] [INFO ] [Real]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-06-02 18:37:37] [INFO ] Computed and/alt/rep : 107/423/107 causal constraints (skipped 136 transitions) in 23 ms.
[2024-06-02 18:37:37] [INFO ] Added : 0 causal constraints over 0 iterations in 42 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 270/270 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-06-02 18:37:37] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:37:37] [INFO ] Invariant cache hit.
[2024-06-02 18:37:37] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:37:37] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:37:37] [INFO ] Invariant cache hit.
[2024-06-02 18:37:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:37:37] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 18:37:37] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:37:37] [INFO ] Invariant cache hit.
[2024-06-02 18:37:37] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 18:37:38] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:37:38] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:37:38] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:37:38] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-06-02 18:37:38] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:37:39] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:37:39] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:37:39] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:37:39] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2024-06-02 18:37:39] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:37:39] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 9979 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14573 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24725ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24729ms
Finished structural reductions in LTL mode , in 1 iterations and 24915 ms. Remains : 99/99 places, 270/270 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (2179 resets) in 119 ms. (333 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (21 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
[2024-06-02 18:38:02] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:38:02] [INFO ] Invariant cache hit.
[2024-06-02 18:38:02] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/95 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/335 variables, 95/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 35/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/339 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/342 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/343 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/343 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/343 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/95 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/335 variables, 95/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 35/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/339 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/342 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/343 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/343 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/343 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 220ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 270/270 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 98 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 98 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 97 transition count 265
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
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 13 place count 94 transition count 272
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 19 place count 94 transition count 266
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 22 place count 94 transition count 263
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 94 transition count 266
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 29 place count 92 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 92 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 91 transition count 260
Applied a total of 32 rules in 34 ms. Remains 91 /99 variables (removed 8) and now considering 260/270 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 91/99 places, 260/270 transitions.
RANDOM walk for 31095 steps (2036 resets) in 53 ms. (575 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2024-06-02 18:38:03] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:38:03] [INFO ] Invariant cache hit.
[2024-06-02 18:38:03] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 18:38:03] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-02 18:38:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:38:03] [INFO ] [Real]Added 37 Read/Feed constraints in 4 ms returned sat
[2024-06-02 18:38:03] [INFO ] Computed and/alt/rep : 107/423/107 causal constraints (skipped 136 transitions) in 20 ms.
[2024-06-02 18:38:03] [INFO ] Added : 0 causal constraints over 0 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 84 ms.
Product exploration explored 100000 steps with 0 reset in 161 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 270/270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 99 transition count 270
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 98 transition count 269
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 98 transition count 269
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 98 transition count 278
Deduced a syphon composed of 3 places in 0 ms
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 10 place count 98 transition count 274
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 10 rules in 17 ms. Remains 98 /99 variables (removed 1) and now considering 274/270 (removed -4) transitions.
[2024-06-02 18:38:04] [INFO ] Redundant transitions in 1 ms returned []
Running 273 sub problems to find dead transitions.
[2024-06-02 18:38:04] [INFO ] Flow matrix only has 244 transitions (discarded 30 similar events)
// Phase 1: matrix 244 rows 98 cols
[2024-06-02 18:38:04] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:38:04] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-02 18:38:05] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 18:38:05] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
[2024-06-02 18:38:05] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:38:05] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2024-06-02 18:38:05] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2024-06-02 18:38:06] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:38:06] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:38:06] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 18:38:06] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:38:06] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:38:06] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-06-02 18:38:06] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 12/19 constraints. Problems are: Problem set: 4 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 269 unsolved
Problem TDEAD252 is UNSAT
At refinement iteration 4 (OVERLAPS) 243/341 variables, 98/117 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 39/156 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/156 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 1/342 variables, 1/157 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/157 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 0/342 variables, 0/157 constraints. Problems are: Problem set: 5 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 157 constraints, problems are : Problem set: 5 solved, 268 unsolved in 10384 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 5 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 3/97 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 12/19 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 243/340 variables, 97/116 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 39/155 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 268/423 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/423 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/341 variables, 1/424 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/424 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 10 (OVERLAPS) 1/342 variables, 1/425 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/425 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 12 (OVERLAPS) 0/342 variables, 0/425 constraints. Problems are: Problem set: 5 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 425 constraints, problems are : Problem set: 5 solved, 268 unsolved in 22361 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 268/273 constraints, Known Traps: 12/12 constraints]
After SMT, in 32886ms problems are : Problem set: 5 solved, 268 unsolved
Search for dead transitions found 5 dead transitions in 32890ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 98/99 places, 269/270 transitions.
Graph (complete) has 521 edges and 98 vertex of which 95 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 95 /98 variables (removed 3) and now considering 269/269 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/99 places, 269/270 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32926 ms. Remains : 95/99 places, 269/270 transitions.
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 270/270 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-06-02 18:38:37] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 18:38:37] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:38:37] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 18:38:37] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:38:37] [INFO ] Invariant cache hit.
[2024-06-02 18:38:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:38:37] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 18:38:37] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:38:37] [INFO ] Invariant cache hit.
[2024-06-02 18:38:37] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 18:38:38] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:38:38] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10067 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14878 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 25117ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 25121ms
Finished structural reductions in LTL mode , in 1 iterations and 25321 ms. Remains : 99/99 places, 270/270 transitions.
Treatment of property FireWire-PT-01-LTLFireability-07 finished in 112337 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 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 99 transition count 272
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 98 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 97 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 97 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 96 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 96 transition count 267
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 2 with 4 rules applied. Total rules applied 12 place count 94 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 94 transition count 267
Applied a total of 16 rules in 12 ms. Remains 94 /101 variables (removed 7) and now considering 267/275 (removed 8) transitions.
[2024-06-02 18:39:02] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
// Phase 1: matrix 237 rows 94 cols
[2024-06-02 18:39:02] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:39:02] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:39:02] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
[2024-06-02 18:39:02] [INFO ] Invariant cache hit.
[2024-06-02 18:39:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:39:02] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-02 18:39:02] [INFO ] Redundant transitions in 1 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 18:39:02] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
[2024-06-02 18:39:02] [INFO ] Invariant cache hit.
[2024-06-02 18:39:02] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 18:39:03] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:39:03] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:39:03] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2024-06-02 18:39:03] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:39:03] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2024-06-02 18:39:04] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:39:04] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:39:04] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:39:04] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 236/329 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/146 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 18:39:06] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/331 variables, and 148 constraints, problems are : Problem set: 0 solved, 264 unsolved in 10769 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 236/329 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 264/411 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/331 variables, and 412 constraints, problems are : Problem set: 0 solved, 264 unsolved in 13771 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 10/10 constraints]
After SMT, in 24700ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 24703ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/101 places, 267/275 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24893 ms. Remains : 94/101 places, 267/275 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 54 ms.
Product exploration explored 100000 steps with 2 reset in 45 ms.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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 46 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2530 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2294 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 274 steps, run visited all 1 properties in 5 ms. (steps per millisecond=54 )
Probabilistic random walk after 274 steps, saw 210 distinct states, run finished after 5 ms. (steps per millisecond=54 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 267/267 transitions.
Applied a total of 0 rules in 10 ms. Remains 94 /94 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-06-02 18:39:28] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
[2024-06-02 18:39:28] [INFO ] Invariant cache hit.
[2024-06-02 18:39:28] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 18:39:28] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
[2024-06-02 18:39:28] [INFO ] Invariant cache hit.
[2024-06-02 18:39:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:39:28] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-02 18:39:28] [INFO ] Redundant transitions in 1 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 18:39:28] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
[2024-06-02 18:39:28] [INFO ] Invariant cache hit.
[2024-06-02 18:39:28] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 18:39:29] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:39:29] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:39:29] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:39:29] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:39:29] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:39:29] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:39:29] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:39:29] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-06-02 18:39:29] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 236/329 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/146 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 18:39:32] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/331 variables, and 148 constraints, problems are : Problem set: 0 solved, 264 unsolved in 10992 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 236/329 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 264/411 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/331 variables, and 412 constraints, problems are : Problem set: 0 solved, 264 unsolved in 13761 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 10/10 constraints]
After SMT, in 24896ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 24899ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25096 ms. Remains : 94/94 places, 267/267 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 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 44 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2506 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2277 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 274 steps, run visited all 1 properties in 4 ms. (steps per millisecond=68 )
Probabilistic random walk after 274 steps, saw 210 distinct states, run finished after 5 ms. (steps per millisecond=54 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 79 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 41 ms.
Product exploration explored 100000 steps with 1 reset in 47 ms.
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 267/267 transitions.
Applied a total of 0 rules in 9 ms. Remains 94 /94 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-06-02 18:39:53] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
[2024-06-02 18:39:53] [INFO ] Invariant cache hit.
[2024-06-02 18:39:53] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 18:39:53] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
[2024-06-02 18:39:53] [INFO ] Invariant cache hit.
[2024-06-02 18:39:53] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:39:53] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-06-02 18:39:53] [INFO ] Redundant transitions in 1 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 18:39:53] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
[2024-06-02 18:39:53] [INFO ] Invariant cache hit.
[2024-06-02 18:39:53] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 18:39:54] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:39:54] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 0 ms to minimize.
[2024-06-02 18:39:54] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:39:55] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:39:55] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:39:55] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:39:55] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:39:55] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:39:55] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 236/329 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/146 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 18:39:58] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/331 variables, and 148 constraints, problems are : Problem set: 0 solved, 264 unsolved in 10926 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 236/329 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 264/411 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/331 variables, and 412 constraints, problems are : Problem set: 0 solved, 264 unsolved in 13786 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 10/10 constraints]
After SMT, in 24885ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 24888ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25107 ms. Remains : 94/94 places, 267/267 transitions.
Treatment of property FireWire-PT-01-LTLFireability-08 finished in 76186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||G(p1)))))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 270
Applied a total of 4 rules in 4 ms. Remains 99 /101 variables (removed 2) and now considering 270/275 (removed 5) transitions.
[2024-06-02 18:40:18] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 18:40:18] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:40:18] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 18:40:18] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:40:18] [INFO ] Invariant cache hit.
[2024-06-02 18:40:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:40:19] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 18:40:19] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:40:19] [INFO ] Invariant cache hit.
[2024-06-02 18:40:19] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 18:40:20] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:40:20] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:40:20] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:40:20] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:40:20] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:40:20] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:40:20] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:40:20] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:40:21] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:40:21] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:40:21] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10061 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14689 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24896ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24899ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 270/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25081 ms. Remains : 99/101 places, 270/275 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-01-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-01-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-11 finished in 25327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 270
Applied a total of 4 rules in 4 ms. Remains 99 /101 variables (removed 2) and now considering 270/275 (removed 5) transitions.
[2024-06-02 18:40:44] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:40:44] [INFO ] Invariant cache hit.
[2024-06-02 18:40:44] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:40:44] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:40:44] [INFO ] Invariant cache hit.
[2024-06-02 18:40:44] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:40:44] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 18:40:44] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:40:44] [INFO ] Invariant cache hit.
[2024-06-02 18:40:44] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 18:40:45] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:40:45] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:40:45] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:40:45] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:40:46] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:40:46] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:40:46] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:40:46] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:40:46] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:40:46] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:40:46] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10095 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14667 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24897ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24900ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 270/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25083 ms. Remains : 99/101 places, 270/275 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-01-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-13 finished in 25197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 270
Applied a total of 4 rules in 3 ms. Remains 99 /101 variables (removed 2) and now considering 270/275 (removed 5) transitions.
[2024-06-02 18:41:09] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:41:09] [INFO ] Invariant cache hit.
[2024-06-02 18:41:09] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:41:09] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:41:09] [INFO ] Invariant cache hit.
[2024-06-02 18:41:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 18:41:09] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 18:41:09] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 18:41:09] [INFO ] Invariant cache hit.
[2024-06-02 18:41:09] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 18:41:10] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:41:11] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:41:11] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:41:11] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:41:11] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:41:11] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:41:11] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:41:11] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:41:11] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:41:11] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:41:11] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10138 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14709 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24994ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24998ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 270/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25188 ms. Remains : 99/101 places, 270/275 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-01-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-15 finished in 25349 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))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p1)&&p0))))))'
Found a Shortening insensitive property : FireWire-PT-01-LTLFireability-07
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 100 transition count 274
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 100 transition count 273
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 99 transition count 273
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 98 transition count 270
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 98 transition count 270
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 97 transition count 268
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 97 transition count 268
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 95 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 95 transition count 271
Applied a total of 14 rules in 18 ms. Remains 95 /101 variables (removed 6) and now considering 271/275 (removed 4) transitions.
[2024-06-02 18:41:35] [INFO ] Flow matrix only has 241 transitions (discarded 30 similar events)
// Phase 1: matrix 241 rows 95 cols
[2024-06-02 18:41:35] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:41:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 18:41:35] [INFO ] Flow matrix only has 241 transitions (discarded 30 similar events)
[2024-06-02 18:41:35] [INFO ] Invariant cache hit.
[2024-06-02 18:41:35] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:41:35] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 18:41:35] [INFO ] Flow matrix only has 241 transitions (discarded 30 similar events)
[2024-06-02 18:41:35] [INFO ] Invariant cache hit.
[2024-06-02 18:41:35] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 18:41:36] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:41:36] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2024-06-02 18:41:36] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:41:37] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:41:37] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:41:37] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2024-06-02 18:41:37] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:41:37] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:41:37] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-02 18:41:37] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 240/335 variables, 95/112 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/336 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 151 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10404 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 240/335 variables, 95/112 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 270/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 421 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15822 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 10/10 constraints]
After SMT, in 26385ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 26389ms
Starting structural reductions in LI_LTL mode, iteration 1 : 95/101 places, 271/275 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 26585 ms. Remains : 95/101 places, 271/275 transitions.
Running random walk in product with property : FireWire-PT-01-LTLFireability-07
Product exploration explored 100000 steps with 2 reset in 47 ms.
Product exploration explored 100000 steps with 0 reset in 55 ms.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 36248 steps (2250 resets) in 96 ms. (373 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2024-06-02 18:42:02] [INFO ] Flow matrix only has 241 transitions (discarded 30 similar events)
[2024-06-02 18:42:02] [INFO ] Invariant cache hit.
[2024-06-02 18:42:02] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:42:02] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-06-02 18:42:02] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:42:02] [INFO ] [Real]Added 39 Read/Feed constraints in 6 ms returned sat
[2024-06-02 18:42:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:42:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:42:02] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-02 18:42:02] [INFO ] [Nat]Added 39 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:42:02] [INFO ] Computed and/alt/rep : 103/420/103 causal constraints (skipped 137 transitions) in 19 ms.
[2024-06-02 18:42:03] [INFO ] Added : 29 causal constraints over 7 iterations in 159 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 271/271 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2024-06-02 18:42:03] [INFO ] Flow matrix only has 241 transitions (discarded 30 similar events)
[2024-06-02 18:42:03] [INFO ] Invariant cache hit.
[2024-06-02 18:42:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:42:03] [INFO ] Flow matrix only has 241 transitions (discarded 30 similar events)
[2024-06-02 18:42:03] [INFO ] Invariant cache hit.
[2024-06-02 18:42:03] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:42:03] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 18:42:03] [INFO ] Flow matrix only has 241 transitions (discarded 30 similar events)
[2024-06-02 18:42:03] [INFO ] Invariant cache hit.
[2024-06-02 18:42:03] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 18:42:04] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:42:04] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:42:04] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:42:05] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:42:05] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:42:05] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2024-06-02 18:42:05] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:42:05] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:42:05] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-06-02 18:42:05] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 240/335 variables, 95/112 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/336 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 151 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10284 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 240/335 variables, 95/112 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 270/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 421 constraints, problems are : Problem set: 0 solved, 270 unsolved in 16161 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 10/10 constraints]
After SMT, in 26648ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 26652ms
Finished structural reductions in LTL mode , in 1 iterations and 26833 ms. Remains : 95/95 places, 271/271 transitions.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (2403 resets) in 76 ms. (519 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (16 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
[2024-06-02 18:42:30] [INFO ] Flow matrix only has 241 transitions (discarded 30 similar events)
[2024-06-02 18:42:30] [INFO ] Invariant cache hit.
[2024-06-02 18:42:30] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/93 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 239/332 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/335 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/336 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/336 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/93 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 239/332 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/335 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/336 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/336 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 267ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2024-06-02 18:42:31] [INFO ] Flow matrix only has 241 transitions (discarded 30 similar events)
[2024-06-02 18:42:31] [INFO ] Invariant cache hit.
[2024-06-02 18:42:31] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:42:31] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-06-02 18:42:31] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:42:31] [INFO ] [Real]Added 39 Read/Feed constraints in 7 ms returned sat
[2024-06-02 18:42:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:42:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:42:31] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-02 18:42:31] [INFO ] [Nat]Added 39 Read/Feed constraints in 9 ms returned sat
[2024-06-02 18:42:31] [INFO ] Computed and/alt/rep : 103/420/103 causal constraints (skipped 137 transitions) in 20 ms.
[2024-06-02 18:42:31] [INFO ] Added : 29 causal constraints over 7 iterations in 131 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 42 ms.
Product exploration explored 100000 steps with 1 reset in 47 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 271/271 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 95 transition count 269
Applied a total of 2 rules in 13 ms. Remains 95 /95 variables (removed 0) and now considering 269/271 (removed 2) transitions.
[2024-06-02 18:42:32] [INFO ] Redundant transitions in 1 ms returned []
Running 268 sub problems to find dead transitions.
[2024-06-02 18:42:32] [INFO ] Flow matrix only has 239 transitions (discarded 30 similar events)
// Phase 1: matrix 239 rows 95 cols
[2024-06-02 18:42:32] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:42:32] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 0 ms to minimize.
[2024-06-02 18:42:34] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:42:34] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:42:34] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:42:34] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 0 ms to minimize.
[2024-06-02 18:42:34] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 238/333 variables, 95/110 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 38/148 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-02 18:42:36] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/334 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (OVERLAPS) 0/334 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 150 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11777 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 238/333 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 268/417 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/334 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (OVERLAPS) 0/334 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 418 constraints, problems are : Problem set: 0 solved, 268 unsolved in 15227 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 9/9 constraints]
After SMT, in 27181ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 27184ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/95 places, 269/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27207 ms. Remains : 95/95 places, 269/271 transitions.
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 271/271 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2024-06-02 18:42:59] [INFO ] Flow matrix only has 241 transitions (discarded 30 similar events)
// Phase 1: matrix 241 rows 95 cols
[2024-06-02 18:42:59] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:42:59] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 18:42:59] [INFO ] Flow matrix only has 241 transitions (discarded 30 similar events)
[2024-06-02 18:42:59] [INFO ] Invariant cache hit.
[2024-06-02 18:42:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 18:42:59] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 18:42:59] [INFO ] Flow matrix only has 241 transitions (discarded 30 similar events)
[2024-06-02 18:42:59] [INFO ] Invariant cache hit.
[2024-06-02 18:42:59] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 18:43:01] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:43:01] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:43:01] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:43:01] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:43:01] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:43:01] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:43:01] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:43:01] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:43:01] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:43:01] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 240/335 variables, 95/112 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/336 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 151 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 240/335 variables, 95/112 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 38/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 270/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 421 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15648 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 10/10 constraints]
After SMT, in 25805ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 25809ms
Finished structural reductions in LTL mode , in 1 iterations and 26010 ms. Remains : 95/95 places, 271/271 transitions.
Treatment of property FireWire-PT-01-LTLFireability-07 finished in 110671 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 18:43:25] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:43:25] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 18:43:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 101 places, 275 transitions and 990 arcs took 6 ms.
Total runtime 561362 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FireWire-PT-01-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-01-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-01-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717353809554

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name FireWire-PT-01-LTLFireability-02
ltl formula formula --ltl=/tmp/2278/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 101 places, 275 transitions and 990 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2278/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2278/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2278/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2278/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 102 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 102, there are 323 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~211 levels ~10000 states ~124268 transitions
pnml2lts-mc( 1/ 4): ~570 levels ~20000 states ~251884 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~234!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7876
pnml2lts-mc( 0/ 4): unique states count: 20731
pnml2lts-mc( 0/ 4): unique transitions count: 269764
pnml2lts-mc( 0/ 4): - self-loop count: 32394
pnml2lts-mc( 0/ 4): - claim dead count: 95525
pnml2lts-mc( 0/ 4): - claim found count: 97251
pnml2lts-mc( 0/ 4): - claim success count: 20889
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2418
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21103 states 275626 transitions, fanout: 13.061
pnml2lts-mc( 0/ 4): Total exploration time 0.250 sec (0.230 sec minimum, 0.240 sec on average)
pnml2lts-mc( 0/ 4): States per second: 84412, Transitions per second: 1102504
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 9.5 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 278 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name FireWire-PT-01-LTLFireability-07
ltl formula formula --ltl=/tmp/2278/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 101 places, 275 transitions and 990 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2278/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2278/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2278/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2278/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 102 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 102, there are 298 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~222 levels ~10000 states ~68548 transitions
pnml2lts-mc( 2/ 4): ~262 levels ~20000 states ~128856 transitions
pnml2lts-mc( 2/ 4): ~298 levels ~40000 states ~268424 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~285!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 20250
pnml2lts-mc( 0/ 4): unique states count: 51971
pnml2lts-mc( 0/ 4): unique transitions count: 386965
pnml2lts-mc( 0/ 4): - self-loop count: 39634
pnml2lts-mc( 0/ 4): - claim dead count: 160692
pnml2lts-mc( 0/ 4): - claim found count: 127710
pnml2lts-mc( 0/ 4): - claim success count: 52116
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3162
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 52268 states 389950 transitions, fanout: 7.461
pnml2lts-mc( 0/ 4): Total exploration time 0.460 sec (0.440 sec minimum, 0.455 sec on average)
pnml2lts-mc( 0/ 4): States per second: 113626, Transitions per second: 847717
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.5MB, 8.9 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 278 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.5MB (~256.0MB paged-in)
ltl formula name FireWire-PT-01-LTLFireability-08
ltl formula formula --ltl=/tmp/2278/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 101 places, 275 transitions and 990 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2278/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2278/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2278/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2278/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 102 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 102, there are 285 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~142 levels ~10000 states ~60256 transitions
pnml2lts-mc( 1/ 4): ~158 levels ~20000 states ~126104 transitions
pnml2lts-mc( 1/ 4): ~166 levels ~40000 states ~264036 transitions
pnml2lts-mc( 1/ 4): ~716 levels ~80000 states ~629424 transitions
pnml2lts-mc( 1/ 4): ~1482 levels ~160000 states ~1386056 transitions
pnml2lts-mc( 3/ 4): ~1279 levels ~320000 states ~2746040 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~136!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 86753
pnml2lts-mc( 0/ 4): unique states count: 262925
pnml2lts-mc( 0/ 4): unique transitions count: 2319837
pnml2lts-mc( 0/ 4): - self-loop count: 166688
pnml2lts-mc( 0/ 4): - claim dead count: 859551
pnml2lts-mc( 0/ 4): - claim found count: 1042915
pnml2lts-mc( 0/ 4): - claim success count: 265331
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8113
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 271388 states 2403355 transitions, fanout: 8.856
pnml2lts-mc( 0/ 4): Total exploration time 2.240 sec (2.240 sec minimum, 2.240 sec on average)
pnml2lts-mc( 0/ 4): States per second: 121155, Transitions per second: 1072926
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.1MB, 8.4 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 278 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-01, 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 r553-tall-171734901100172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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