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-171734901400307.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-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901400307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K 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 168K 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-18-LTLCardinality-00
FORMULA_NAME FireWire-PT-18-LTLCardinality-01
FORMULA_NAME FireWire-PT-18-LTLCardinality-02
FORMULA_NAME FireWire-PT-18-LTLCardinality-03
FORMULA_NAME FireWire-PT-18-LTLCardinality-04
FORMULA_NAME FireWire-PT-18-LTLCardinality-05
FORMULA_NAME FireWire-PT-18-LTLCardinality-06
FORMULA_NAME FireWire-PT-18-LTLCardinality-07
FORMULA_NAME FireWire-PT-18-LTLCardinality-08
FORMULA_NAME FireWire-PT-18-LTLCardinality-09
FORMULA_NAME FireWire-PT-18-LTLCardinality-10
FORMULA_NAME FireWire-PT-18-LTLCardinality-11
FORMULA_NAME FireWire-PT-18-LTLCardinality-12
FORMULA_NAME FireWire-PT-18-LTLCardinality-13
FORMULA_NAME FireWire-PT-18-LTLCardinality-14
FORMULA_NAME FireWire-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717357436104

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:43:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:43:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:43:57] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-02 19:43:57] [INFO ] Transformed 437 places.
[2024-06-02 19:43:57] [INFO ] Transformed 707 transitions.
[2024-06-02 19:43:57] [INFO ] Found NUPN structural information;
[2024-06-02 19:43:57] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FireWire-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 707/707 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 428 transition count 707
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 104 place count 333 transition count 612
Iterating global reduction 1 with 95 rules applied. Total rules applied 199 place count 333 transition count 612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 200 place count 333 transition count 611
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 225 place count 308 transition count 518
Iterating global reduction 2 with 25 rules applied. Total rules applied 250 place count 308 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 251 place count 308 transition count 517
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 256 place count 303 transition count 509
Iterating global reduction 3 with 5 rules applied. Total rules applied 261 place count 303 transition count 509
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 263 place count 303 transition count 507
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 265 place count 301 transition count 501
Iterating global reduction 4 with 2 rules applied. Total rules applied 267 place count 301 transition count 501
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 268 place count 300 transition count 499
Iterating global reduction 4 with 1 rules applied. Total rules applied 269 place count 300 transition count 499
Applied a total of 269 rules in 100 ms. Remains 300 /437 variables (removed 137) and now considering 499/707 (removed 208) transitions.
// Phase 1: matrix 499 rows 300 cols
[2024-06-02 19:43:57] [INFO ] Computed 7 invariants in 21 ms
[2024-06-02 19:43:58] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-06-02 19:43:58] [INFO ] Invariant cache hit.
[2024-06-02 19:43:58] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 19:43:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:44:03] [INFO ] Deduced a trap composed of 147 places in 157 ms of which 22 ms to minimize.
[2024-06-02 19:44:03] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:44:03] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:44:04] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 4 ms to minimize.
[2024-06-02 19:44:04] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:44:04] [INFO ] Deduced a trap composed of 76 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:44:04] [INFO ] Deduced a trap composed of 90 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:44:05] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 2 ms to minimize.
[2024-06-02 19:44:05] [INFO ] Deduced a trap composed of 178 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:44:05] [INFO ] Deduced a trap composed of 75 places in 143 ms of which 2 ms to minimize.
[2024-06-02 19:44:06] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:44:09] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:44:11] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/798 variables, 299/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:44:18] [INFO ] Deduced a trap composed of 133 places in 105 ms of which 3 ms to minimize.
[2024-06-02 19:44:18] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 1 ms to minimize.
[2024-06-02 19:44:19] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:44:28] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 798/799 variables, and 323 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 299/300 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:44:31] [INFO ] Deduced a trap composed of 148 places in 138 ms of which 2 ms to minimize.
[2024-06-02 19:44:31] [INFO ] Deduced a trap composed of 171 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:44:31] [INFO ] Deduced a trap composed of 170 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:44:31] [INFO ] Deduced a trap composed of 168 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:44:31] [INFO ] Deduced a trap composed of 167 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/798 variables, 299/328 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 491/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:44:43] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:44:46] [INFO ] Deduced a trap composed of 176 places in 107 ms of which 2 ms to minimize.
[2024-06-02 19:44:46] [INFO ] Deduced a trap composed of 170 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:44:46] [INFO ] Deduced a trap composed of 173 places in 104 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 4/823 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 798/799 variables, and 823 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 299/300 constraints, PredecessorRefiner: 491/498 constraints, Known Traps: 26/26 constraints]
After SMT, in 60355ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60375ms
Starting structural reductions in LTL mode, iteration 1 : 300/437 places, 499/707 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61193 ms. Remains : 300/437 places, 499/707 transitions.
Support contains 29 out of 300 places after structural reductions.
[2024-06-02 19:44:58] [INFO ] Flatten gal took : 62 ms
[2024-06-02 19:44:59] [INFO ] Flatten gal took : 32 ms
[2024-06-02 19:44:59] [INFO ] Input system was already deterministic with 499 transitions.
RANDOM walk for 40000 steps (18 resets) in 2025 ms. (19 steps per ms) remains 9/17 properties
BEST_FIRST walk for 40000 steps (19 resets) in 487 ms. (81 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (24 resets) in 267 ms. (149 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (12 resets) in 264 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (15 resets) in 161 ms. (246 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (23 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (33 resets) in 324 ms. (123 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (14 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (12 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (12 resets) in 189 ms. (210 steps per ms) remains 9/9 properties
[2024-06-02 19:45:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 226/242 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 29/271 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 472/743 variables, 271/278 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 26/769 variables, 13/291 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 20/789 variables, 8/299 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/789 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 10/799 variables, 8/307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/799 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/799 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 307 constraints, problems are : Problem set: 0 solved, 9 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 226/242 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:45:01] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 3 ms to minimize.
[2024-06-02 19:45:01] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 29/271 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:45:01] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:45:01] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 472/743 variables, 271/282 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/743 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:45:02] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/743 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:45:02] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/743 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/743 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 26/769 variables, 13/305 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/769 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/769 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 20/789 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/789 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 10/799 variables, 8/322 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:45:03] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/799 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/799 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/799 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 799/799 variables, and 323 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2567 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 7/7 constraints]
After SMT, in 3313ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 7969 ms.
Support contains 16 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 499/499 transitions.
Graph (trivial) has 197 edges and 300 vertex of which 9 / 300 are part of one of the 3 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 294 transition count 449
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 82 place count 255 transition count 446
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 82 place count 255 transition count 419
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 136 place count 228 transition count 419
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 139 place count 225 transition count 415
Iterating global reduction 2 with 3 rules applied. Total rules applied 142 place count 225 transition count 415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 142 place count 225 transition count 414
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 144 place count 224 transition count 414
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 188 place count 202 transition count 392
Performed 28 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 244 place count 174 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 245 place count 174 transition count 448
Free-agglomeration rule applied 19 times.
Iterating global reduction 3 with 19 rules applied. Total rules applied 264 place count 174 transition count 429
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 289 place count 155 transition count 423
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 293 place count 151 transition count 419
Iterating global reduction 4 with 4 rules applied. Total rules applied 297 place count 151 transition count 419
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 303 place count 151 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 320 place count 151 transition count 396
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 321 place count 151 transition count 396
Applied a total of 321 rules in 236 ms. Remains 151 /300 variables (removed 149) and now considering 396/499 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 151/300 places, 396/499 transitions.
RANDOM walk for 40000 steps (1880 resets) in 527 ms. (75 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (463 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (468 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (462 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (455 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (487 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
[2024-06-02 19:45:12] [INFO ] Flow matrix only has 389 transitions (discarded 7 similar events)
// Phase 1: matrix 389 rows 151 cols
[2024-06-02 19:45:12] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:45:12] [INFO ] State equation strengthened by 67 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 105/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 29/142 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 389/531 variables, 142/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 67/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 9/540 variables, 9/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/540 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/540 variables, and 225 constraints, problems are : Problem set: 0 solved, 5 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 105/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 29/142 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:45:12] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-06-02 19:45:13] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 389/531 variables, 142/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 67/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:45:13] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 9/540 variables, 9/232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/540 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/540 variables, and 233 constraints, problems are : Problem set: 0 solved, 5 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 1059ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1543 ms.
Support contains 8 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 396/396 transitions.
Graph (trivial) has 24 edges and 151 vertex of which 2 / 151 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 150 transition count 392
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 148 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 147 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 147 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 146 transition count 387
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 146 transition count 387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 145 transition count 385
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 145 transition count 385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 144 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 144 transition count 382
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 143 transition count 380
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 143 transition count 380
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 142 transition count 377
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 142 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 141 transition count 375
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 141 transition count 375
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 140 transition count 372
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 140 transition count 372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 139 transition count 370
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 139 transition count 370
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 27 place count 137 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 136 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 136 transition count 366
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 33 place count 134 transition count 372
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 134 transition count 368
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 134 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 134 transition count 367
Applied a total of 39 rules in 64 ms. Remains 134 /151 variables (removed 17) and now considering 367/396 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 134/151 places, 367/396 transitions.
RANDOM walk for 40000 steps (2022 resets) in 133 ms. (298 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (496 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (490 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (508 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (509 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
[2024-06-02 19:45:15] [INFO ] Flow matrix only has 360 transitions (discarded 7 similar events)
// Phase 1: matrix 360 rows 134 cols
[2024-06-02 19:45:15] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:45:15] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 92/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/125 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 360/485 variables, 125/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 64/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 9/494 variables, 9/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/494 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 205 constraints, problems are : Problem set: 0 solved, 4 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 134/134 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 92/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/125 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:45:15] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:45:15] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:45:15] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 360/485 variables, 125/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 64/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:45:15] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:45:16] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/485 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 9/494 variables, 9/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/494 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/494 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 494/494 variables, and 214 constraints, problems are : Problem set: 0 solved, 4 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 134/134 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 902ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 690 ms.
Support contains 6 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 367/367 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 134 transition count 365
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 132 transition count 365
Applied a total of 4 rules in 9 ms. Remains 132 /134 variables (removed 2) and now considering 365/367 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 132/134 places, 365/367 transitions.
RANDOM walk for 40000 steps (2031 resets) in 114 ms. (347 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (479 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (492 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (501 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
[2024-06-02 19:45:17] [INFO ] Flow matrix only has 358 transitions (discarded 7 similar events)
// Phase 1: matrix 358 rows 132 cols
[2024-06-02 19:45:17] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:45:17] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 91/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 27/123 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 358/481 variables, 123/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 64/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/490 variables, 9/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/490 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 203 constraints, problems are : Problem set: 0 solved, 3 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 132/132 constraints, ReadFeed: 64/64 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 91/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 27/123 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:45:17] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:45:17] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 358/481 variables, 123/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 64/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:45:17] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 9/490 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/490 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 209 constraints, problems are : Problem set: 0 solved, 3 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 132/132 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 635ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 520 ms.
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 365/365 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 132 transition count 364
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 364
Applied a total of 2 rules in 12 ms. Remains 131 /132 variables (removed 1) and now considering 364/365 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 131/132 places, 364/365 transitions.
RANDOM walk for 40000 steps (1978 resets) in 240 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (491 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (505 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (500 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1399657 steps, run timeout after 3001 ms. (steps per millisecond=466 ) properties seen :2 out of 3
Probabilistic random walk after 1399657 steps, saw 338691 distinct states, run finished after 3004 ms. (steps per millisecond=465 ) properties seen :2
[2024-06-02 19:45:21] [INFO ] Flow matrix only has 357 transitions (discarded 7 similar events)
// Phase 1: matrix 357 rows 131 cols
[2024-06-02 19:45:21] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:45:21] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/120 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:45:21] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 356/476 variables, 120/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 64/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/488 variables, 11/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/488 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 131/131 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/120 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:45:21] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 356/476 variables, 120/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 64/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/488 variables, 11/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/488 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 131/131 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 447ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 364/364 transitions.
Graph (complete) has 642 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 127 transition count 358
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 127 transition count 358
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 9 place count 125 transition count 354
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 125 transition count 354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 124 transition count 351
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 124 transition count 351
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 123 transition count 349
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 123 transition count 349
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 122 transition count 346
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 122 transition count 346
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 121 transition count 344
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 121 transition count 344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 120 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 120 transition count 341
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 119 transition count 339
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 119 transition count 339
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 118 transition count 337
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 118 transition count 337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 117 transition count 335
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 117 transition count 335
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 117 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 116 transition count 334
Applied a total of 29 rules in 32 ms. Remains 116 /131 variables (removed 15) and now considering 334/364 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 116/131 places, 334/364 transitions.
RANDOM walk for 40000 steps (2021 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35130 steps (427 resets) in 32 ms. (1064 steps per ms) remains 0/1 properties
Computed a total of 87 stabilizing places and 131 stable transitions
Graph (complete) has 930 edges and 300 vertex of which 299 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 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(p2))&&p1))&&p0)))'
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 499
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 290 transition count 486
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 290 transition count 486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 287 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 287 transition count 480
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 285 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 285 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 283 transition count 470
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 283 transition count 470
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 281 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 281 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 279 transition count 460
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 279 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 277 transition count 455
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 277 transition count 455
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 275 transition count 450
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 275 transition count 450
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 273 transition count 446
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 273 transition count 446
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 271 transition count 442
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 271 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 269 transition count 439
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 269 transition count 439
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 268 transition count 438
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 268 transition count 438
Applied a total of 63 rules in 27 ms. Remains 268 /300 variables (removed 32) and now considering 438/499 (removed 61) transitions.
// Phase 1: matrix 438 rows 268 cols
[2024-06-02 19:45:22] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 19:45:22] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 19:45:22] [INFO ] Invariant cache hit.
[2024-06-02 19:45:22] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2024-06-02 19:45:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 19:45:26] [INFO ] Deduced a trap composed of 172 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:45:26] [INFO ] Deduced a trap composed of 155 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:45:26] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:45:27] [INFO ] Deduced a trap composed of 76 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:45:27] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 2 ms to minimize.
[2024-06-02 19:45:27] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:45:28] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:45:28] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:45:28] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:45:28] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 19:45:30] [INFO ] Deduced a trap composed of 150 places in 96 ms of which 6 ms to minimize.
[2024-06-02 19:45:30] [INFO ] Deduced a trap composed of 159 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:45:31] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (OVERLAPS) 438/706 variables, 268/288 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 19:45:37] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/706 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/706 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 8 (OVERLAPS) 0/706 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 437 unsolved
No progress, stopping.
After SMT solving in domain Real declared 706/706 variables, and 289 constraints, problems are : Problem set: 0 solved, 437 unsolved in 29905 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 437 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 19:45:54] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:45:54] [INFO ] Deduced a trap composed of 156 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:45:55] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:45:55] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:45:55] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:45:56] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 19:45:58] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 6 (OVERLAPS) 438/706 variables, 268/296 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/706 variables, 437/733 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/706 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 19:46:18] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 706/706 variables, and 734 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 22/22 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 268/300 places, 438/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60435 ms. Remains : 268/300 places, 438/499 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : FireWire-PT-18-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-18-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLCardinality-00 finished in 60845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 499/499 transitions.
Graph (trivial) has 208 edges and 300 vertex of which 12 / 300 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 919 edges and 291 vertex of which 290 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 289 transition count 447
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 248 transition count 444
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 87 place count 248 transition count 417
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 141 place count 221 transition count 417
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 147 place count 215 transition count 409
Iterating global reduction 2 with 6 rules applied. Total rules applied 153 place count 215 transition count 409
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 153 place count 215 transition count 407
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 157 place count 213 transition count 407
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 159 place count 211 transition count 402
Iterating global reduction 2 with 2 rules applied. Total rules applied 161 place count 211 transition count 402
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 162 place count 210 transition count 400
Iterating global reduction 2 with 1 rules applied. Total rules applied 163 place count 210 transition count 400
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 164 place count 209 transition count 397
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 209 transition count 397
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 208 transition count 395
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 208 transition count 395
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 207 transition count 392
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 207 transition count 392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 206 transition count 390
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 206 transition count 390
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 205 transition count 387
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 205 transition count 387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 204 transition count 385
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 204 transition count 385
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 203 transition count 383
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 203 transition count 383
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 178 place count 202 transition count 381
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 202 transition count 381
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 225 place count 179 transition count 358
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 285 place count 149 transition count 420
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 287 place count 149 transition count 418
Applied a total of 287 rules in 72 ms. Remains 149 /300 variables (removed 151) and now considering 418/499 (removed 81) transitions.
[2024-06-02 19:46:23] [INFO ] Flow matrix only has 399 transitions (discarded 19 similar events)
// Phase 1: matrix 399 rows 149 cols
[2024-06-02 19:46:23] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:46:23] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 19:46:23] [INFO ] Flow matrix only has 399 transitions (discarded 19 similar events)
[2024-06-02 19:46:23] [INFO ] Invariant cache hit.
[2024-06-02 19:46:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 19:46:23] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-06-02 19:46:23] [INFO ] Redundant transitions in 25 ms returned []
Running 413 sub problems to find dead transitions.
[2024-06-02 19:46:23] [INFO ] Flow matrix only has 399 transitions (discarded 19 similar events)
[2024-06-02 19:46:23] [INFO ] Invariant cache hit.
[2024-06-02 19:46:23] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:46:26] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 2 ms to minimize.
[2024-06-02 19:46:26] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2024-06-02 19:46:26] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:46:26] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:46:27] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-06-02 19:46:27] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:46:27] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:46:27] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (OVERLAPS) 398/547 variables, 149/164 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (OVERLAPS) 0/547 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 413 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/548 variables, and 173 constraints, problems are : Problem set: 0 solved, 413 unsolved in 13965 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 1/149 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (OVERLAPS) 398/547 variables, 149/164 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 413/586 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 19:46:58] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/547 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/548 variables, and 587 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 9/9 constraints]
After SMT, in 44347ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 44351ms
Starting structural reductions in SI_LTL mode, iteration 1 : 149/300 places, 418/499 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44735 ms. Remains : 149/300 places, 418/499 transitions.
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p1)]
Running random walk in product with property : FireWire-PT-18-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLCardinality-02 finished in 44800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X(p1)) U X((p2&&X(F(p3)))))))'
Support contains 7 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 499
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 289 transition count 487
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 289 transition count 487
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 285 transition count 480
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 285 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 284 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 284 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 283 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 283 transition count 475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 282 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 282 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 281 transition count 470
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 281 transition count 470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 280 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 280 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 279 transition count 465
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 279 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 278 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 278 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 277 transition count 461
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 277 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 276 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 276 transition count 459
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 275 transition count 458
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 275 transition count 458
Applied a total of 49 rules in 31 ms. Remains 275 /300 variables (removed 25) and now considering 458/499 (removed 41) transitions.
// Phase 1: matrix 458 rows 275 cols
[2024-06-02 19:47:07] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:47:07] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 19:47:07] [INFO ] Invariant cache hit.
[2024-06-02 19:47:08] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-02 19:47:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 19:47:12] [INFO ] Deduced a trap composed of 163 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:47:12] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:47:12] [INFO ] Deduced a trap composed of 76 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:47:13] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:47:13] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:47:13] [INFO ] Deduced a trap composed of 88 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:47:13] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:47:14] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:47:14] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:47:14] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 19:47:16] [INFO ] Deduced a trap composed of 155 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:47:16] [INFO ] Deduced a trap composed of 153 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:47:16] [INFO ] Deduced a trap composed of 158 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:47:16] [INFO ] Deduced a trap composed of 165 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 19:47:21] [INFO ] Deduced a trap composed of 166 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 19:47:24] [INFO ] Deduced a trap composed of 162 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:47:24] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:47:24] [INFO ] Deduced a trap composed of 156 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:47:24] [INFO ] Deduced a trap composed of 154 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:47:25] [INFO ] Deduced a trap composed of 154 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:47:25] [INFO ] Deduced a trap composed of 174 places in 102 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 19:47:28] [INFO ] Deduced a trap composed of 159 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:47:29] [INFO ] Deduced a trap composed of 155 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:47:29] [INFO ] Deduced a trap composed of 156 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:47:29] [INFO ] Deduced a trap composed of 155 places in 88 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 19:47:35] [INFO ] Deduced a trap composed of 155 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:47:35] [INFO ] Deduced a trap composed of 155 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:47:35] [INFO ] Deduced a trap composed of 174 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:47:35] [INFO ] Deduced a trap composed of 191 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 19:47:37] [INFO ] Deduced a trap composed of 157 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:47:37] [INFO ] Deduced a trap composed of 162 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:47:37] [INFO ] Deduced a trap composed of 164 places in 86 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/733 variables, and 39 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/275 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 19:47:40] [INFO ] Deduced a trap composed of 159 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:47:40] [INFO ] Deduced a trap composed of 157 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:47:41] [INFO ] Deduced a trap composed of 160 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:47:41] [INFO ] Deduced a trap composed of 186 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:47:42] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 19:47:44] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 1 ms to minimize.
[2024-06-02 19:47:44] [INFO ] Deduced a trap composed of 161 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:47:44] [INFO ] Deduced a trap composed of 160 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:47:45] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:47:45] [INFO ] Deduced a trap composed of 91 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (OVERLAPS) 458/733 variables, 275/324 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/733 variables, 457/781 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/733 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 733/733 variables, and 781 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 42/42 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 275/300 places, 458/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60582 ms. Remains : 275/300 places, 458/499 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : FireWire-PT-18-LTLCardinality-03
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLCardinality-03 finished in 60836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&F(p2)))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 499
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 289 transition count 486
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 289 transition count 486
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 284 transition count 477
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 284 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 282 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 282 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 280 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 280 transition count 467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 278 transition count 462
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 278 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 276 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 276 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 274 transition count 452
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 274 transition count 452
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 273 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 273 transition count 450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 272 transition count 448
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 272 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 271 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 271 transition count 446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 270 transition count 445
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 270 transition count 445
Applied a total of 59 rules in 36 ms. Remains 270 /300 variables (removed 30) and now considering 445/499 (removed 54) transitions.
// Phase 1: matrix 445 rows 270 cols
[2024-06-02 19:48:08] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:48:08] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-06-02 19:48:08] [INFO ] Invariant cache hit.
[2024-06-02 19:48:09] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2024-06-02 19:48:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-06-02 19:48:13] [INFO ] Deduced a trap composed of 161 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:48:13] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:48:13] [INFO ] Deduced a trap composed of 77 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:48:13] [INFO ] Deduced a trap composed of 89 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:48:14] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:48:14] [INFO ] Deduced a trap composed of 76 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:48:14] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:48:14] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:48:15] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:48:15] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (OVERLAPS) 445/715 variables, 270/287 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-06-02 19:48:21] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 7 ms to minimize.
[2024-06-02 19:48:22] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/715 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 7 (OVERLAPS) 0/715 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 444 unsolved
No progress, stopping.
After SMT solving in domain Real declared 715/715 variables, and 289 constraints, problems are : Problem set: 0 solved, 444 unsolved in 26231 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (OVERLAPS) 445/715 variables, 270/289 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/715 variables, 444/733 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-06-02 19:48:44] [INFO ] Deduced a trap composed of 169 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:48:44] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:48:46] [INFO ] Deduced a trap composed of 157 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 3/736 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 153 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 160 places in 103 ms of which 1 ms to minimize.
[2024-06-02 19:48:58] [INFO ] Deduced a trap composed of 160 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/715 variables, 3/739 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 715/715 variables, and 739 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 18/18 constraints]
After SMT, in 56390ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 56394ms
Starting structural reductions in LTL mode, iteration 1 : 270/300 places, 445/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56984 ms. Remains : 270/300 places, 445/499 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-18-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Computed a total of 61 stabilizing places and 82 stable transitions
Computed a total of 61 stabilizing places and 82 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 21 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-18-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-18-LTLCardinality-04 finished in 57639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 499/499 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 291 transition count 486
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 291 transition count 486
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 287 transition count 478
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 287 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 285 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 285 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 283 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 283 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 281 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 281 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 279 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 279 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 277 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 277 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 275 transition count 448
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 275 transition count 448
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 273 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 273 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 272 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 272 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 271 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 271 transition count 441
Applied a total of 58 rules in 31 ms. Remains 271 /300 variables (removed 29) and now considering 441/499 (removed 58) transitions.
// Phase 1: matrix 441 rows 271 cols
[2024-06-02 19:49:06] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:49:06] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-02 19:49:06] [INFO ] Invariant cache hit.
[2024-06-02 19:49:06] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 440 sub problems to find dead transitions.
[2024-06-02 19:49:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-02 19:49:10] [INFO ] Deduced a trap composed of 163 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:49:10] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:49:10] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:49:11] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:49:11] [INFO ] Deduced a trap composed of 149 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:49:11] [INFO ] Deduced a trap composed of 156 places in 90 ms of which 3 ms to minimize.
[2024-06-02 19:49:11] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 0 ms to minimize.
[2024-06-02 19:49:11] [INFO ] Deduced a trap composed of 76 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:49:12] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:49:12] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:49:13] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-02 19:49:15] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:49:15] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-02 19:49:20] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-02 19:49:23] [INFO ] Deduced a trap composed of 166 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 7 (OVERLAPS) 441/711 variables, 270/292 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-02 19:49:30] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/711 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-02 19:49:35] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 711/712 variables, and 294 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 270/271 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-02 19:49:38] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 2 ms to minimize.
[2024-06-02 19:49:39] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:49:39] [INFO ] Deduced a trap composed of 167 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:49:39] [INFO ] Deduced a trap composed of 180 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:49:39] [INFO ] Deduced a trap composed of 154 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:49:39] [INFO ] Deduced a trap composed of 150 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:49:40] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:49:40] [INFO ] Deduced a trap composed of 154 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:49:40] [INFO ] Deduced a trap composed of 151 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:49:40] [INFO ] Deduced a trap composed of 150 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:49:40] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:49:41] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:49:41] [INFO ] Deduced a trap composed of 161 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 5 (OVERLAPS) 441/711 variables, 270/307 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/711 variables, 433/740 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-02 19:49:48] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:49:50] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/711 variables, 2/742 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 711/712 variables, and 742 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 270/271 constraints, PredecessorRefiner: 433/440 constraints, Known Traps: 32/32 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in LTL mode, iteration 1 : 271/300 places, 441/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60609 ms. Remains : 271/300 places, 441/499 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-18-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Computed a total of 64 stabilizing places and 81 stable transitions
Graph (complete) has 807 edges and 271 vertex of which 270 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 64 stabilizing places and 81 stable transitions
Detected a total of 64/271 stabilizing places and 81/441 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-18-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-18-LTLCardinality-05 finished in 61062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 499/499 transitions.
Graph (trivial) has 210 edges and 300 vertex of which 12 / 300 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 919 edges and 291 vertex of which 290 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 289 transition count 445
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 246 transition count 442
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 91 place count 246 transition count 415
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 145 place count 219 transition count 415
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 151 place count 213 transition count 406
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 213 transition count 406
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 157 place count 213 transition count 404
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 161 place count 211 transition count 404
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 163 place count 209 transition count 400
Iterating global reduction 2 with 2 rules applied. Total rules applied 165 place count 209 transition count 400
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 208 transition count 397
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 208 transition count 397
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 207 transition count 395
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 207 transition count 395
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 206 transition count 392
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 206 transition count 392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 205 transition count 390
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 205 transition count 390
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 204 transition count 387
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 204 transition count 387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 203 transition count 385
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 203 transition count 385
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 178 place count 202 transition count 383
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 202 transition count 383
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 180 place count 201 transition count 381
Iterating global reduction 2 with 1 rules applied. Total rules applied 181 place count 201 transition count 381
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 227 place count 178 transition count 358
Performed 29 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 285 place count 149 transition count 421
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 287 place count 149 transition count 419
Applied a total of 287 rules in 57 ms. Remains 149 /300 variables (removed 151) and now considering 419/499 (removed 80) transitions.
[2024-06-02 19:50:07] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
// Phase 1: matrix 400 rows 149 cols
[2024-06-02 19:50:07] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:50:07] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-06-02 19:50:07] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 19:50:07] [INFO ] Invariant cache hit.
[2024-06-02 19:50:07] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-02 19:50:08] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2024-06-02 19:50:08] [INFO ] Redundant transitions in 6 ms returned []
Running 414 sub problems to find dead transitions.
[2024-06-02 19:50:08] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 19:50:08] [INFO ] Invariant cache hit.
[2024-06-02 19:50:08] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-06-02 19:50:11] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:50:11] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:50:11] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-06-02 19:50:11] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:50:11] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:50:12] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:50:12] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (OVERLAPS) 399/548 variables, 149/163 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 8 (OVERLAPS) 0/548 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 414 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/549 variables, and 170 constraints, problems are : Problem set: 0 solved, 414 unsolved in 14725 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (OVERLAPS) 1/149 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (OVERLAPS) 399/548 variables, 149/163 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 414/584 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 414 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/549 variables, and 584 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 7/7 constraints]
After SMT, in 45105ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 45109ms
Starting structural reductions in SI_LTL mode, iteration 1 : 149/300 places, 419/499 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45923 ms. Remains : 149/300 places, 419/499 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-18-LTLCardinality-08
Product exploration explored 100000 steps with 7 reset in 134 ms.
Product exploration explored 100000 steps with 6 reset in 83 ms.
Computed a total of 32 stabilizing places and 62 stable transitions
Computed a total of 32 stabilizing places and 62 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2063 resets) in 579 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (467 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (472 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (478 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (475 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 678841 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :2 out of 4
Probabilistic random walk after 678841 steps, saw 175864 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :2
[2024-06-02 19:50:57] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 19:50:57] [INFO ] Invariant cache hit.
[2024-06-02 19:50:57] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/122 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 382/504 variables, 122/128 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 2/130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 44/548 variables, 27/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 5/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/548 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/548 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/549 variables, and 163 constraints, problems are : Problem set: 1 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/122 variables, 5/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 382/504 variables, 122/128 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 2/130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 44/548 variables, 27/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 5/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/548 variables, 1/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/548 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/548 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/549 variables, and 164 constraints, problems are : Problem set: 1 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 333ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 419/419 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 149 transition count 416
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 148 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 148 transition count 414
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 147 transition count 411
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 147 transition count 411
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 146 transition count 409
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 146 transition count 409
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 145 transition count 406
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 145 transition count 406
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 144 transition count 404
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 144 transition count 404
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 143 transition count 401
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 143 transition count 401
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 142 transition count 399
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 142 transition count 399
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 141 transition count 396
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 141 transition count 396
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 140 transition count 394
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 140 transition count 394
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 139 transition count 392
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 139 transition count 392
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 138 transition count 390
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 138 transition count 390
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 137 transition count 389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 136 transition count 390
Free-agglomeration rule applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 45 place count 136 transition count 374
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 67 place count 120 transition count 368
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 71 place count 116 transition count 364
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 116 transition count 364
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 81 place count 116 transition count 358
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 99 place count 116 transition count 340
Applied a total of 99 rules in 44 ms. Remains 116 /149 variables (removed 33) and now considering 340/419 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 116/149 places, 340/419 transitions.
RANDOM walk for 40000 steps (1973 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (489 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1431611 steps, run visited all 1 properties in 2650 ms. (steps per millisecond=540 )
Probabilistic random walk after 1431611 steps, saw 366267 distinct states, run finished after 2654 ms. (steps per millisecond=539 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 173 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 149 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 419/419 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2024-06-02 19:51:00] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 19:51:00] [INFO ] Invariant cache hit.
[2024-06-02 19:51:00] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-02 19:51:00] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 19:51:00] [INFO ] Invariant cache hit.
[2024-06-02 19:51:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-02 19:51:01] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-06-02 19:51:01] [INFO ] Redundant transitions in 27 ms returned []
Running 414 sub problems to find dead transitions.
[2024-06-02 19:51:01] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 19:51:01] [INFO ] Invariant cache hit.
[2024-06-02 19:51:01] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-06-02 19:51:04] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:51:04] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:51:04] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:51:04] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:51:04] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
[2024-06-02 19:51:05] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:51:05] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (OVERLAPS) 399/548 variables, 149/163 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 8 (OVERLAPS) 0/548 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 414 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/549 variables, and 170 constraints, problems are : Problem set: 0 solved, 414 unsolved in 14556 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (OVERLAPS) 1/149 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (OVERLAPS) 399/548 variables, 149/163 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 414/584 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 414 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/549 variables, and 584 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 7/7 constraints]
After SMT, in 44899ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 44904ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45442 ms. Remains : 149/149 places, 419/419 transitions.
Computed a total of 32 stabilizing places and 62 stable transitions
Computed a total of 32 stabilizing places and 62 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2053 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (471 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1744 steps, run visited all 1 properties in 7 ms. (steps per millisecond=249 )
Probabilistic random walk after 1744 steps, saw 580 distinct states, run finished after 7 ms. (steps per millisecond=249 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 146 ms.
Product exploration explored 100000 steps with 3 reset in 71 ms.
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 419/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 149 /149 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2024-06-02 19:51:46] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 19:51:46] [INFO ] Invariant cache hit.
[2024-06-02 19:51:47] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-06-02 19:51:47] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 19:51:47] [INFO ] Invariant cache hit.
[2024-06-02 19:51:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-02 19:51:47] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-06-02 19:51:47] [INFO ] Redundant transitions in 2 ms returned []
Running 414 sub problems to find dead transitions.
[2024-06-02 19:51:47] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 19:51:47] [INFO ] Invariant cache hit.
[2024-06-02 19:51:47] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-06-02 19:51:50] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2024-06-02 19:51:50] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:51:50] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:51:50] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:51:50] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:51:50] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:51:51] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (OVERLAPS) 399/548 variables, 149/163 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 8 (OVERLAPS) 0/548 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 414 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/549 variables, and 170 constraints, problems are : Problem set: 0 solved, 414 unsolved in 14567 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (OVERLAPS) 1/149 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (OVERLAPS) 399/548 variables, 149/163 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 414/584 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 414 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/549 variables, and 584 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 7/7 constraints]
After SMT, in 44885ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 44891ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45430 ms. Remains : 149/149 places, 419/419 transitions.
Treatment of property FireWire-PT-18-LTLCardinality-08 finished in 144975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 499
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 287 transition count 483
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 287 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 282 transition count 474
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 282 transition count 474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 280 transition count 469
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 280 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 278 transition count 464
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 278 transition count 464
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 276 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 276 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 274 transition count 454
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 274 transition count 454
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 272 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 272 transition count 449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 270 transition count 444
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 270 transition count 444
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 268 transition count 440
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 268 transition count 440
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 266 transition count 436
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 266 transition count 436
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 264 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 264 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 263 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 263 transition count 432
Applied a total of 73 rules in 27 ms. Remains 263 /300 variables (removed 37) and now considering 432/499 (removed 67) transitions.
// Phase 1: matrix 432 rows 263 cols
[2024-06-02 19:52:32] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:52:32] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-02 19:52:32] [INFO ] Invariant cache hit.
[2024-06-02 19:52:32] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-06-02 19:52:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-02 19:52:36] [INFO ] Deduced a trap composed of 166 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:52:36] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:52:36] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:52:37] [INFO ] Deduced a trap composed of 149 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:52:37] [INFO ] Deduced a trap composed of 77 places in 44 ms of which 0 ms to minimize.
[2024-06-02 19:52:37] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:52:38] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:52:38] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:52:38] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 432/695 variables, 263/279 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-02 19:52:45] [INFO ] Deduced a trap composed of 106 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:52:45] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-02 19:52:49] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 8 (OVERLAPS) 0/695 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 431 unsolved
No progress, stopping.
After SMT solving in domain Real declared 695/695 variables, and 282 constraints, problems are : Problem set: 0 solved, 431 unsolved in 28777 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 432/695 variables, 263/282 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 431/713 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-02 19:53:09] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:53:10] [INFO ] Deduced a trap composed of 153 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:53:10] [INFO ] Deduced a trap composed of 146 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:53:10] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 4/717 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-02 19:53:21] [INFO ] Deduced a trap composed of 158 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:53:23] [INFO ] Deduced a trap composed of 162 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:53:23] [INFO ] Deduced a trap composed of 158 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 163 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 4/721 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 695/695 variables, and 721 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 20/20 constraints]
After SMT, in 58924ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 58928ms
Starting structural reductions in LTL mode, iteration 1 : 263/300 places, 432/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59505 ms. Remains : 263/300 places, 432/499 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-18-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 140 steps with 1 reset in 0 ms.
FORMULA FireWire-PT-18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLCardinality-10 finished in 59651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
[2024-06-02 19:53:32] [INFO ] Flatten gal took : 30 ms
[2024-06-02 19:53:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-02 19:53:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 300 places, 499 transitions and 1553 arcs took 6 ms.
Total runtime 574983 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FireWire-PT-18-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717358012541

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FireWire-PT-18-LTLCardinality-08
ltl formula formula --ltl=/tmp/1567/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 300 places, 499 transitions and 1553 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.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1567/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1567/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1567/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1567/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 300 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 301, there are 532 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( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~92!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 301
pnml2lts-mc( 0/ 4): unique states count: 721
pnml2lts-mc( 0/ 4): unique transitions count: 1991
pnml2lts-mc( 0/ 4): - self-loop count: 43
pnml2lts-mc( 0/ 4): - claim dead count: 307
pnml2lts-mc( 0/ 4): - claim found count: 77
pnml2lts-mc( 0/ 4): - claim success count: 733
pnml2lts-mc( 0/ 4): - cum. max stack depth: 383
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 733 states 2019 transitions, fanout: 2.754
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 36650, Transitions per second: 100950
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 17.5 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 511 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~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-18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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