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-171734900900108.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 CO4-PT-14, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734900900108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 174K 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 CO4-PT-14-LTLFireability-00
FORMULA_NAME CO4-PT-14-LTLFireability-01
FORMULA_NAME CO4-PT-14-LTLFireability-02
FORMULA_NAME CO4-PT-14-LTLFireability-03
FORMULA_NAME CO4-PT-14-LTLFireability-04
FORMULA_NAME CO4-PT-14-LTLFireability-05
FORMULA_NAME CO4-PT-14-LTLFireability-06
FORMULA_NAME CO4-PT-14-LTLFireability-07
FORMULA_NAME CO4-PT-14-LTLFireability-08
FORMULA_NAME CO4-PT-14-LTLFireability-09
FORMULA_NAME CO4-PT-14-LTLFireability-10
FORMULA_NAME CO4-PT-14-LTLFireability-11
FORMULA_NAME CO4-PT-14-LTLFireability-12
FORMULA_NAME CO4-PT-14-LTLFireability-13
FORMULA_NAME CO4-PT-14-LTLFireability-14
FORMULA_NAME CO4-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717351761157

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:09:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:09:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:09:22] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-02 18:09:22] [INFO ] Transformed 680 places.
[2024-06-02 18:09:22] [INFO ] Transformed 812 transitions.
[2024-06-02 18:09:22] [INFO ] Found NUPN structural information;
[2024-06-02 18:09:22] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 100 places in 12 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-14-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 692/692 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 569 transition count 691
Discarding 121 places :
Symmetric choice reduction at 1 with 121 rule applications. Total rules 133 place count 448 transition count 568
Iterating global reduction 1 with 121 rules applied. Total rules applied 254 place count 448 transition count 568
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 259 place count 448 transition count 563
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 324 place count 383 transition count 498
Iterating global reduction 2 with 65 rules applied. Total rules applied 389 place count 383 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 383 transition count 497
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 402 place count 371 transition count 482
Iterating global reduction 3 with 12 rules applied. Total rules applied 414 place count 371 transition count 482
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 417 place count 371 transition count 479
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 420 place count 368 transition count 476
Iterating global reduction 4 with 3 rules applied. Total rules applied 423 place count 368 transition count 476
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 425 place count 366 transition count 474
Iterating global reduction 4 with 2 rules applied. Total rules applied 427 place count 366 transition count 474
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 429 place count 366 transition count 472
Applied a total of 429 rules in 135 ms. Remains 366 /580 variables (removed 214) and now considering 472/692 (removed 220) transitions.
// Phase 1: matrix 472 rows 366 cols
[2024-06-02 18:09:22] [INFO ] Computed 5 invariants in 20 ms
[2024-06-02 18:09:23] [INFO ] Implicit Places using invariants in 265 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 296 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 365/580 places, 472/692 transitions.
Applied a total of 0 rules in 9 ms. Remains 365 /365 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 456 ms. Remains : 365/580 places, 472/692 transitions.
Support contains 25 out of 365 places after structural reductions.
[2024-06-02 18:09:23] [INFO ] Flatten gal took : 58 ms
[2024-06-02 18:09:23] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:09:23] [INFO ] Input system was already deterministic with 472 transitions.
RANDOM walk for 40000 steps (167 resets) in 1628 ms. (24 steps per ms) remains 15/21 properties
BEST_FIRST walk for 4004 steps (24 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (25 resets) in 32 ms. (121 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4001 steps (19 resets) in 30 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (27 resets) in 39 ms. (100 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (14 resets) in 31 ms. (125 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (22 resets) in 45 ms. (87 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (24 resets) in 40 ms. (97 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (16 resets) in 66 ms. (59 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (21 resets) in 50 ms. (78 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (26 resets) in 43 ms. (90 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (21 resets) in 73 ms. (54 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (21 resets) in 35 ms. (111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (25 resets) in 35 ms. (111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (20 resets) in 48 ms. (81 steps per ms) remains 14/14 properties
// Phase 1: matrix 472 rows 365 cols
[2024-06-02 18:09:24] [INFO ] Computed 4 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 62/77 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 269/346 variables, 85/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 304/650 variables, 154/254 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 13/663 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 3/666 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 129/795 variables, 80/343 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/795 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 36/831 variables, 22/365 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/831 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 6/837 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/837 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 0/837 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 837/837 variables, and 369 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1541 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 62/77 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 269/346 variables, 85/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 304/650 variables, 154/268 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 13/663 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 3/666 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 129/795 variables, 80/357 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/795 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 36/831 variables, 22/379 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/831 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 6/837 variables, 4/383 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/837 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 0/837 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 837/837 variables, and 383 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1695 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 3274ms problems are : Problem set: 0 solved, 14 unsolved
Finished Parikh walk after 93 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=46 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 14 properties in 1094 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 612 edges and 365 vertex of which 362 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1||G((G(F(!p0)) U p2)))))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 390 edges and 365 vertex of which 2 / 365 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 611 edges and 364 vertex of which 361 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 360 transition count 336
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 229 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 267 place count 228 transition count 334
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 267 place count 228 transition count 293
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 349 place count 187 transition count 293
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 351 place count 185 transition count 291
Iterating global reduction 3 with 2 rules applied. Total rules applied 353 place count 185 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 353 place count 185 transition count 290
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 355 place count 184 transition count 290
Performed 62 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 479 place count 122 transition count 214
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 487 place count 122 transition count 206
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 489 place count 121 transition count 205
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 494 place count 116 transition count 200
Iterating global reduction 5 with 5 rules applied. Total rules applied 499 place count 116 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 500 place count 116 transition count 199
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 506 place count 113 transition count 196
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 570 place count 81 transition count 198
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 590 place count 81 transition count 178
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 617 place count 54 transition count 124
Iterating global reduction 7 with 27 rules applied. Total rules applied 644 place count 54 transition count 124
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 662 place count 54 transition count 106
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 668 place count 48 transition count 89
Iterating global reduction 8 with 6 rules applied. Total rules applied 674 place count 48 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 678 place count 48 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 682 place count 48 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 684 place count 46 transition count 79
Applied a total of 684 rules in 74 ms. Remains 46 /365 variables (removed 319) and now considering 79/472 (removed 393) transitions.
[2024-06-02 18:09:29] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
// Phase 1: matrix 74 rows 46 cols
[2024-06-02 18:09:29] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:09:29] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 18:09:29] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
[2024-06-02 18:09:29] [INFO ] Invariant cache hit.
[2024-06-02 18:09:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:09:29] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-02 18:09:29] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-02 18:09:29] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
[2024-06-02 18:09:29] [INFO ] Invariant cache hit.
[2024-06-02 18:09:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 73/119 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 1/120 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 52 constraints, problems are : Problem set: 0 solved, 66 unsolved in 806 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 73/119 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 66/117 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 118 constraints, problems are : Problem set: 0 solved, 66 unsolved in 924 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 1765ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1767ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/365 places, 79/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1931 ms. Remains : 46/365 places, 79/472 transitions.
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-00
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA CO4-PT-14-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-00 finished in 2328 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 U (F(G(!p2)) U p2))))))'
Support contains 4 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 356 transition count 463
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 356 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 355 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 355 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 354 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 354 transition count 461
Applied a total of 22 rules in 42 ms. Remains 354 /365 variables (removed 11) and now considering 461/472 (removed 11) transitions.
// Phase 1: matrix 461 rows 354 cols
[2024-06-02 18:09:31] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:09:31] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 18:09:31] [INFO ] Invariant cache hit.
[2024-06-02 18:09:31] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-02 18:09:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/815 variables, 354/358 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-02 18:09:43] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 18 ms to minimize.
[2024-06-02 18:09:43] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 360 constraints, problems are : Problem set: 0 solved, 460 unsolved in 29805 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 461/815 variables, 354/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 460/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (OVERLAPS) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Int declared 815/815 variables, and 820 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
After SMT, in 59935ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 59941ms
Starting structural reductions in LTL mode, iteration 1 : 354/365 places, 461/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60239 ms. Remains : 354/365 places, 461/472 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, p2, (NOT p2), (NOT p2)]
Running random walk in product with property : CO4-PT-14-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-14-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-01 finished in 60460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(p1)))||(p0&&X((p1&&X(F(p2)))))))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 355 transition count 462
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 355 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 354 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 354 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 353 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 353 transition count 460
Applied a total of 24 rules in 24 ms. Remains 353 /365 variables (removed 12) and now considering 460/472 (removed 12) transitions.
// Phase 1: matrix 460 rows 353 cols
[2024-06-02 18:10:31] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:10:31] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 18:10:31] [INFO ] Invariant cache hit.
[2024-06-02 18:10:32] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-02 18:10:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (OVERLAPS) 460/813 variables, 353/357 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 18:10:43] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 3 ms to minimize.
[2024-06-02 18:10:44] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (OVERLAPS) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 359 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 460/813 variables, 353/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 459/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (OVERLAPS) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 818 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 353/365 places, 460/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60399 ms. Remains : 353/365 places, 460/472 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : CO4-PT-14-LTLFireability-02
Product exploration explored 100000 steps with 3398 reset in 244 ms.
Product exploration explored 100000 steps with 3388 reset in 175 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 599 edges and 353 vertex of which 350 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 113 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (78 resets) in 181 ms. (219 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (270 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (218 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (43 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
[2024-06-02 18:11:33] [INFO ] Invariant cache hit.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/88 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 234/322 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 20/342 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 162/504 variables, 91/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 166/670 variables, 70/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/670 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 113/783 variables, 64/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/783 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 21/804 variables, 12/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/804 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 9/813 variables, 5/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/813 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/813 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 357 constraints, problems are : Problem set: 0 solved, 3 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/88 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 234/322 variables, 98/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 20/342 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 162/504 variables, 91/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:11:33] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 166/670 variables, 70/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/670 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 113/783 variables, 64/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/783 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 21/804 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/804 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 9/813 variables, 5/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/813 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/813 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 361 constraints, problems are : Problem set: 0 solved, 3 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 780ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 27 ms.
Support contains 1 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 460/460 transitions.
Graph (trivial) has 383 edges and 353 vertex of which 2 / 353 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 597 edges and 352 vertex of which 334 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 136 rules applied. Total rules applied 138 place count 334 transition count 307
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 262 place count 211 transition count 306
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 262 place count 211 transition count 258
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 358 place count 163 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 359 place count 162 transition count 257
Iterating global reduction 2 with 1 rules applied. Total rules applied 360 place count 162 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 361 place count 162 transition count 256
Performed 55 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 471 place count 107 transition count 190
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 480 place count 107 transition count 181
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 482 place count 106 transition count 180
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 486 place count 102 transition count 176
Iterating global reduction 5 with 4 rules applied. Total rules applied 490 place count 102 transition count 176
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 496 place count 99 transition count 173
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 500 place count 99 transition count 169
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 504 place count 95 transition count 165
Iterating global reduction 6 with 4 rules applied. Total rules applied 508 place count 95 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 509 place count 95 transition count 164
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 515 place count 92 transition count 161
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 518 place count 92 transition count 158
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 521 place count 89 transition count 155
Iterating global reduction 8 with 3 rules applied. Total rules applied 524 place count 89 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 526 place count 89 transition count 153
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 527 place count 88 transition count 152
Iterating global reduction 9 with 1 rules applied. Total rules applied 528 place count 88 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 529 place count 88 transition count 151
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 10 with 56 rules applied. Total rules applied 585 place count 60 transition count 153
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 10 with 36 rules applied. Total rules applied 621 place count 60 transition count 117
Discarding 25 places :
Symmetric choice reduction at 11 with 25 rule applications. Total rules 646 place count 35 transition count 81
Iterating global reduction 11 with 25 rules applied. Total rules applied 671 place count 35 transition count 81
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 691 place count 35 transition count 61
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 695 place count 31 transition count 50
Iterating global reduction 12 with 4 rules applied. Total rules applied 699 place count 31 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 702 place count 31 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 704 place count 30 transition count 62
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 707 place count 30 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 715 place count 30 transition count 51
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 716 place count 29 transition count 50
Iterating global reduction 14 with 1 rules applied. Total rules applied 717 place count 29 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 718 place count 29 transition count 49
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 723 place count 29 transition count 44
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 730 place count 24 transition count 42
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 731 place count 24 transition count 42
Graph (complete) has 73 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 732 place count 23 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 733 place count 23 transition count 41
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 734 place count 23 transition count 41
Graph (complete) has 70 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 18 with 1 rules applied. Total rules applied 735 place count 22 transition count 41
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 736 place count 22 transition count 40
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 737 place count 22 transition count 40
Graph (complete) has 67 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 1 rules applied. Total rules applied 738 place count 21 transition count 40
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 739 place count 21 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 740 place count 20 transition count 38
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t44.t420 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 14 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 22 with 3 rules applied. Total rules applied 743 place count 14 transition count 36
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t41.t406.t27.t28.t29.t31.t123.t120.t461.t124.t125 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 10 edges and 12 vertex of which 3 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 23 with 8 rules applied. Total rules applied 751 place count 10 transition count 29
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 24 with 10 rules applied. Total rules applied 761 place count 10 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 25 with 1 rules applied. Total rules applied 762 place count 10 transition count 18
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 763 place count 9 transition count 16
Iterating global reduction 25 with 1 rules applied. Total rules applied 764 place count 9 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 765 place count 9 transition count 15
Free-agglomeration rule applied 2 times.
Iterating global reduction 26 with 2 rules applied. Total rules applied 767 place count 9 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 769 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 27 with 2 rules applied. Total rules applied 771 place count 7 transition count 11
Applied a total of 771 rules in 85 ms. Remains 7 /353 variables (removed 346) and now considering 11/460 (removed 449) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 7/353 places, 11/460 transitions.
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1 (NOT p2)))), (F p2), (F (NOT (AND (OR p0 p2) (OR p1 p2))))]
Knowledge based reduction with 10 factoid took 278 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 3 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 460/460 transitions.
Applied a total of 0 rules in 7 ms. Remains 353 /353 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2024-06-02 18:11:34] [INFO ] Invariant cache hit.
[2024-06-02 18:11:34] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:11:34] [INFO ] Invariant cache hit.
[2024-06-02 18:11:34] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-02 18:11:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (OVERLAPS) 460/813 variables, 353/357 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 18:11:46] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:11:46] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (OVERLAPS) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 359 constraints, problems are : Problem set: 0 solved, 459 unsolved in 29847 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 460/813 variables, 353/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 459/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (OVERLAPS) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 818 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
After SMT, in 59927ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 59932ms
Finished structural reductions in LTL mode , in 1 iterations and 60174 ms. Remains : 353/353 places, 460/460 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 599 edges and 353 vertex of which 350 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (X (NOT p2))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (135 resets) in 103 ms. (384 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (269 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (111 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (76 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
[2024-06-02 18:12:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/88 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 234/322 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 20/342 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 162/504 variables, 91/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 166/670 variables, 70/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/670 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 113/783 variables, 64/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/783 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 21/804 variables, 12/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/804 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 9/813 variables, 5/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/813 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/813 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 357 constraints, problems are : Problem set: 0 solved, 3 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/88 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 234/322 variables, 98/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 20/342 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 162/504 variables, 91/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 166/670 variables, 70/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/670 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 113/783 variables, 64/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/783 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 21/804 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/804 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 9/813 variables, 5/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/813 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/813 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 360 constraints, problems are : Problem set: 0 solved, 3 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 887ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 18 ms.
Support contains 1 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 460/460 transitions.
Graph (trivial) has 383 edges and 353 vertex of which 2 / 353 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 597 edges and 352 vertex of which 334 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 136 rules applied. Total rules applied 138 place count 334 transition count 307
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 262 place count 211 transition count 306
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 262 place count 211 transition count 258
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 358 place count 163 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 359 place count 162 transition count 257
Iterating global reduction 2 with 1 rules applied. Total rules applied 360 place count 162 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 361 place count 162 transition count 256
Performed 55 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 471 place count 107 transition count 190
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 480 place count 107 transition count 181
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 482 place count 106 transition count 180
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 486 place count 102 transition count 176
Iterating global reduction 5 with 4 rules applied. Total rules applied 490 place count 102 transition count 176
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 496 place count 99 transition count 173
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 500 place count 99 transition count 169
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 504 place count 95 transition count 165
Iterating global reduction 6 with 4 rules applied. Total rules applied 508 place count 95 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 509 place count 95 transition count 164
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 515 place count 92 transition count 161
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 518 place count 92 transition count 158
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 521 place count 89 transition count 155
Iterating global reduction 8 with 3 rules applied. Total rules applied 524 place count 89 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 526 place count 89 transition count 153
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 527 place count 88 transition count 152
Iterating global reduction 9 with 1 rules applied. Total rules applied 528 place count 88 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 529 place count 88 transition count 151
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 10 with 56 rules applied. Total rules applied 585 place count 60 transition count 153
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 10 with 36 rules applied. Total rules applied 621 place count 60 transition count 117
Discarding 25 places :
Symmetric choice reduction at 11 with 25 rule applications. Total rules 646 place count 35 transition count 81
Iterating global reduction 11 with 25 rules applied. Total rules applied 671 place count 35 transition count 81
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 691 place count 35 transition count 61
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 695 place count 31 transition count 50
Iterating global reduction 12 with 4 rules applied. Total rules applied 699 place count 31 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 702 place count 31 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 704 place count 30 transition count 62
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 707 place count 30 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 715 place count 30 transition count 51
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 716 place count 29 transition count 50
Iterating global reduction 14 with 1 rules applied. Total rules applied 717 place count 29 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 718 place count 29 transition count 49
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 723 place count 29 transition count 44
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 730 place count 24 transition count 42
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 731 place count 24 transition count 42
Graph (complete) has 73 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 732 place count 23 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 733 place count 23 transition count 41
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 734 place count 23 transition count 41
Graph (complete) has 70 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 18 with 1 rules applied. Total rules applied 735 place count 22 transition count 41
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 736 place count 22 transition count 40
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 737 place count 22 transition count 40
Graph (complete) has 67 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 1 rules applied. Total rules applied 738 place count 21 transition count 40
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 739 place count 21 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 740 place count 20 transition count 38
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t44.t420 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 14 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 22 with 3 rules applied. Total rules applied 743 place count 14 transition count 36
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t41.t406.t27.t28.t29.t31.t123.t120.t461.t124.t125 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 10 edges and 12 vertex of which 3 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 23 with 8 rules applied. Total rules applied 751 place count 10 transition count 29
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 24 with 10 rules applied. Total rules applied 761 place count 10 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 25 with 1 rules applied. Total rules applied 762 place count 10 transition count 18
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 763 place count 9 transition count 16
Iterating global reduction 25 with 1 rules applied. Total rules applied 764 place count 9 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 765 place count 9 transition count 15
Free-agglomeration rule applied 2 times.
Iterating global reduction 26 with 2 rules applied. Total rules applied 767 place count 9 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 769 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 27 with 2 rules applied. Total rules applied 771 place count 7 transition count 11
Applied a total of 771 rules in 45 ms. Remains 7 /353 variables (removed 346) and now considering 11/460 (removed 449) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 7/353 places, 11/460 transitions.
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (X (NOT p2))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (AND (OR p0 p2) (OR p2 p1)))), (F (NOT (AND p0 (NOT p2) p1)))]
Knowledge based reduction with 6 factoid took 198 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 3378 reset in 138 ms.
Product exploration explored 100000 steps with 3407 reset in 172 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 3 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 460/460 transitions.
Graph (trivial) has 379 edges and 353 vertex of which 2 / 353 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 598 edges and 352 vertex of which 349 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 120 rules applied. Total rules applied 122 place count 349 transition count 456
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 123 place count 349 transition count 455
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 123 place count 349 transition count 499
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 169 place count 349 transition count 499
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 194 place count 324 transition count 474
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 219 place count 324 transition count 474
Performed 40 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 181 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 259 place count 324 transition count 523
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 266 place count 324 transition count 516
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 285 place count 305 transition count 493
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 19 rules applied. Total rules applied 304 place count 305 transition count 493
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 305 place count 305 transition count 493
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 306 place count 305 transition count 492
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 308 place count 303 transition count 490
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 310 place count 303 transition count 490
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 311 place count 303 transition count 490
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 312 place count 302 transition count 489
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 313 place count 302 transition count 489
Performed 55 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 4 with 55 rules applied. Total rules applied 368 place count 302 transition count 708
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 421 place count 302 transition count 655
Discarding 113 places :
Symmetric choice reduction at 5 with 113 rule applications. Total rules 534 place count 189 transition count 400
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 5 with 113 rules applied. Total rules applied 647 place count 189 transition count 400
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 681 place count 189 transition count 366
Discarding 70 places :
Symmetric choice reduction at 6 with 70 rule applications. Total rules 751 place count 119 transition count 241
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 6 with 70 rules applied. Total rules applied 821 place count 119 transition count 241
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 828 place count 119 transition count 234
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 842 place count 105 transition count 206
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 7 with 14 rules applied. Total rules applied 856 place count 105 transition count 206
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 857 place count 105 transition count 231
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 864 place count 105 transition count 224
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 867 place count 102 transition count 206
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 870 place count 102 transition count 206
Deduced a syphon composed of 56 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 882 place count 102 transition count 194
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 883 place count 101 transition count 193
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 884 place count 101 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 885 place count 101 transition count 214
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 886 place count 100 transition count 206
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 887 place count 100 transition count 206
Deduced a syphon composed of 55 places in 0 ms
Applied a total of 887 rules in 84 ms. Remains 100 /353 variables (removed 253) and now considering 206/460 (removed 254) transitions.
[2024-06-02 18:12:37] [INFO ] Redundant transitions in 6 ms returned []
Running 205 sub problems to find dead transitions.
[2024-06-02 18:12:37] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
// Phase 1: matrix 201 rows 100 cols
[2024-06-02 18:12:37] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:12:37] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 18:12:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 18:12:38] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 18:12:38] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-06-02 18:12:38] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 193 unsolved
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
At refinement iteration 4 (OVERLAPS) 200/300 variables, 100/108 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 17/125 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/125 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 1/301 variables, 1/126 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/126 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/301 variables, 0/126 constraints. Problems are: Problem set: 132 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 126 constraints, problems are : Problem set: 132 solved, 73 unsolved in 3490 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 132 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 11/55 variables, 4/4 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 4/8 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 191/246 variables, 55/63 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 17/80 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 73/153 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/153 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 54/300 variables, 45/198 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/198 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 1/301 variables, 1/199 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/199 constraints. Problems are: Problem set: 132 solved, 73 unsolved
At refinement iteration 12 (OVERLAPS) 0/301 variables, 0/199 constraints. Problems are: Problem set: 132 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 199 constraints, problems are : Problem set: 132 solved, 73 unsolved in 2766 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 73/205 constraints, Known Traps: 4/4 constraints]
After SMT, in 6297ms problems are : Problem set: 132 solved, 73 unsolved
Search for dead transitions found 132 dead transitions in 6299ms
Found 132 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 132 transitions
Dead transitions reduction (with SMT) removed 132 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 100/353 places, 74/460 transitions.
Graph (complete) has 148 edges and 100 vertex of which 45 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 45 /100 variables (removed 55) and now considering 74/74 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/353 places, 74/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6399 ms. Remains : 45/353 places, 74/460 transitions.
Support contains 3 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 460/460 transitions.
Applied a total of 0 rules in 5 ms. Remains 353 /353 variables (removed 0) and now considering 460/460 (removed 0) transitions.
// Phase 1: matrix 460 rows 353 cols
[2024-06-02 18:12:44] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:12:44] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 18:12:44] [INFO ] Invariant cache hit.
[2024-06-02 18:12:44] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-02 18:12:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (OVERLAPS) 460/813 variables, 353/357 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 18:12:56] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:12:56] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (OVERLAPS) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 359 constraints, problems are : Problem set: 0 solved, 459 unsolved in 29713 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 460/813 variables, 353/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 459/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (OVERLAPS) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 818 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
After SMT, in 59796ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 59800ms
Finished structural reductions in LTL mode , in 1 iterations and 60052 ms. Remains : 353/353 places, 460/460 transitions.
Treatment of property CO4-PT-14-LTLFireability-02 finished in 192527 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(p1))||p0)))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 356 transition count 463
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 356 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 355 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 355 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 354 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 354 transition count 461
Applied a total of 22 rules in 17 ms. Remains 354 /365 variables (removed 11) and now considering 461/472 (removed 11) transitions.
// Phase 1: matrix 461 rows 354 cols
[2024-06-02 18:13:44] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:13:44] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:13:44] [INFO ] Invariant cache hit.
[2024-06-02 18:13:44] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-02 18:13:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/815 variables, 354/358 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-02 18:13:55] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:13:56] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 360 constraints, problems are : Problem set: 0 solved, 460 unsolved in 29178 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 461/815 variables, 354/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 460/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (OVERLAPS) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Int declared 815/815 variables, and 820 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
After SMT, in 59255ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 59260ms
Starting structural reductions in LTL mode, iteration 1 : 354/365 places, 461/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59519 ms. Remains : 354/365 places, 461/472 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-14-LTLFireability-03
Product exploration explored 100000 steps with 11 reset in 102 ms.
Product exploration explored 100000 steps with 7 reset in 102 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 600 edges and 354 vertex of which 351 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 20943 steps (108 resets) in 28 ms. (722 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 354 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 461/461 transitions.
Applied a total of 0 rules in 8 ms. Remains 354 /354 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2024-06-02 18:14:44] [INFO ] Invariant cache hit.
[2024-06-02 18:14:44] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 18:14:44] [INFO ] Invariant cache hit.
[2024-06-02 18:14:44] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-02 18:14:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/815 variables, 354/358 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-02 18:14:56] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 3 ms to minimize.
[2024-06-02 18:14:57] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 360 constraints, problems are : Problem set: 0 solved, 460 unsolved in 29978 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 461/815 variables, 354/360 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 460/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (OVERLAPS) 0/815 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Int declared 815/815 variables, and 820 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 2/2 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Finished structural reductions in LTL mode , in 1 iterations and 60341 ms. Remains : 354/354 places, 461/461 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 600 edges and 354 vertex of which 351 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p1, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (69 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
BEST_FIRST walk for 22316 steps (117 resets) in 27 ms. (797 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Entered a terminal (fully accepting) state of product in 2565 steps with 77 reset in 9 ms.
FORMULA CO4-PT-14-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-03 finished in 121551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(p1)&&F(p2))))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 357 transition count 464
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 357 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 356 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 356 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 355 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 355 transition count 462
Applied a total of 20 rules in 20 ms. Remains 355 /365 variables (removed 10) and now considering 462/472 (removed 10) transitions.
// Phase 1: matrix 462 rows 355 cols
[2024-06-02 18:15:45] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:15:45] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 18:15:45] [INFO ] Invariant cache hit.
[2024-06-02 18:15:46] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-02 18:15:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/355 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/817 variables, 355/359 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-02 18:15:57] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 3 ms to minimize.
[2024-06-02 18:15:57] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (OVERLAPS) 0/817 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 817/817 variables, and 361 constraints, problems are : Problem set: 0 solved, 461 unsolved in 29271 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/355 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 462/817 variables, 355/361 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 461/822 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (OVERLAPS) 0/817 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Int declared 817/817 variables, and 822 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 2/2 constraints]
After SMT, in 59352ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 59356ms
Starting structural reductions in LTL mode, iteration 1 : 355/365 places, 462/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59624 ms. Remains : 355/365 places, 462/472 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-06
Product exploration explored 100000 steps with 16 reset in 102 ms.
Product exploration explored 100000 steps with 40 reset in 101 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 601 edges and 355 vertex of which 352 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p2))), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 110 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (64 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (95 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1829586 steps, run timeout after 3001 ms. (steps per millisecond=609 ) properties seen :0 out of 1
Probabilistic random walk after 1829586 steps, saw 322578 distinct states, run finished after 3004 ms. (steps per millisecond=609 ) properties seen :0
[2024-06-02 18:16:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/41 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 146/187 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/195 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/211 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 236/447 variables, 99/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 260/707 variables, 123/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/707 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 102/809 variables, 68/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/809 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/817 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/817 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/817 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 817/817 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/41 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 146/187 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/195 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/211 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 236/447 variables, 99/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 260/707 variables, 123/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/707 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 102/809 variables, 68/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/809 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/817 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/817 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/817 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 817/817 variables, and 360 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 407ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p2))), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 12 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-14-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-14-LTLFireability-06 finished in 63881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 394 edges and 365 vertex of which 2 / 365 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 611 edges and 364 vertex of which 361 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 360 transition count 335
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 267 place count 228 transition count 334
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 267 place count 228 transition count 292
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 351 place count 186 transition count 292
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 353 place count 184 transition count 290
Iterating global reduction 2 with 2 rules applied. Total rules applied 355 place count 184 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 355 place count 184 transition count 289
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 357 place count 183 transition count 289
Performed 63 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 483 place count 120 transition count 212
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 491 place count 120 transition count 204
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 493 place count 119 transition count 203
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 498 place count 114 transition count 198
Iterating global reduction 4 with 5 rules applied. Total rules applied 503 place count 114 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 504 place count 114 transition count 197
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 510 place count 111 transition count 194
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 576 place count 78 transition count 196
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 596 place count 78 transition count 176
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 624 place count 50 transition count 120
Iterating global reduction 6 with 28 rules applied. Total rules applied 652 place count 50 transition count 120
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 670 place count 50 transition count 102
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 677 place count 43 transition count 82
Iterating global reduction 7 with 7 rules applied. Total rules applied 684 place count 43 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 689 place count 43 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 693 place count 43 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 695 place count 41 transition count 71
Applied a total of 695 rules in 38 ms. Remains 41 /365 variables (removed 324) and now considering 71/472 (removed 401) transitions.
[2024-06-02 18:16:49] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
// Phase 1: matrix 66 rows 41 cols
[2024-06-02 18:16:49] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:16:49] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 18:16:49] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
[2024-06-02 18:16:49] [INFO ] Invariant cache hit.
[2024-06-02 18:16:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:16:49] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-06-02 18:16:49] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-02 18:16:49] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
[2024-06-02 18:16:49] [INFO ] Invariant cache hit.
[2024-06-02 18:16:49] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 65/106 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 1/107 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 47 constraints, problems are : Problem set: 0 solved, 58 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 65/106 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 58/104 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 1/107 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 105 constraints, problems are : Problem set: 0 solved, 58 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 1416ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1416ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/365 places, 71/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1537 ms. Remains : 41/365 places, 71/472 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-08
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-08 finished in 1592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 390 edges and 365 vertex of which 2 / 365 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 611 edges and 364 vertex of which 361 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 360 transition count 335
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 267 place count 228 transition count 334
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 267 place count 228 transition count 293
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 349 place count 187 transition count 293
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 351 place count 185 transition count 291
Iterating global reduction 2 with 2 rules applied. Total rules applied 353 place count 185 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 353 place count 185 transition count 290
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 355 place count 184 transition count 290
Performed 62 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 479 place count 122 transition count 215
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 486 place count 122 transition count 208
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 488 place count 121 transition count 207
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 493 place count 116 transition count 202
Iterating global reduction 4 with 5 rules applied. Total rules applied 498 place count 116 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 499 place count 116 transition count 201
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 505 place count 113 transition count 198
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 571 place count 80 transition count 200
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 592 place count 80 transition count 179
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 620 place count 52 transition count 123
Iterating global reduction 6 with 28 rules applied. Total rules applied 648 place count 52 transition count 123
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 666 place count 52 transition count 105
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 672 place count 46 transition count 87
Iterating global reduction 7 with 6 rules applied. Total rules applied 678 place count 46 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 682 place count 46 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 688 place count 46 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 690 place count 45 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 692 place count 43 transition count 83
Applied a total of 692 rules in 43 ms. Remains 43 /365 variables (removed 322) and now considering 83/472 (removed 389) transitions.
[2024-06-02 18:16:51] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
// Phase 1: matrix 76 rows 43 cols
[2024-06-02 18:16:51] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:16:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 18:16:51] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 18:16:51] [INFO ] Invariant cache hit.
[2024-06-02 18:16:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:16:51] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-02 18:16:51] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-06-02 18:16:51] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 18:16:51] [INFO ] Invariant cache hit.
[2024-06-02 18:16:51] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 75/118 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/119 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 50 constraints, problems are : Problem set: 0 solved, 71 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 75/118 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 71/120 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 1/119 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 121 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2106ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2108ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/365 places, 83/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2233 ms. Remains : 43/365 places, 83/472 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-09
Product exploration explored 100000 steps with 33 reset in 136 ms.
Product exploration explored 100000 steps with 14 reset in 79 ms.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 592 steps (53 resets) in 7 ms. (74 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-06-02 18:16:54] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 18:16:54] [INFO ] Invariant cache hit.
[2024-06-02 18:16:54] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 18:16:54] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 18:16:54] [INFO ] Invariant cache hit.
[2024-06-02 18:16:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:16:54] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-06-02 18:16:54] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-06-02 18:16:54] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 18:16:54] [INFO ] Invariant cache hit.
[2024-06-02 18:16:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 75/118 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/119 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 50 constraints, problems are : Problem set: 0 solved, 71 unsolved in 996 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 75/118 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 71/120 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 1/119 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 121 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1143 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2162ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2162ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2249 ms. Remains : 43/43 places, 83/83 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 2441 steps (237 resets) in 9 ms. (244 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4 reset in 46 ms.
Product exploration explored 100000 steps with 2 reset in 43 ms.
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-06-02 18:16:56] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 18:16:56] [INFO ] Invariant cache hit.
[2024-06-02 18:16:56] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-02 18:16:56] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 18:16:56] [INFO ] Invariant cache hit.
[2024-06-02 18:16:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:16:56] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-06-02 18:16:56] [INFO ] Redundant transitions in 0 ms returned []
Running 71 sub problems to find dead transitions.
[2024-06-02 18:16:56] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 18:16:56] [INFO ] Invariant cache hit.
[2024-06-02 18:16:56] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 75/118 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/119 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 50 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1005 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 75/118 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 71/120 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 1/119 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 121 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1089 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2118ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2119ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2198 ms. Remains : 43/43 places, 83/83 transitions.
Treatment of property CO4-PT-14-LTLFireability-09 finished in 7700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&(!p1||X(G(p2))))))))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 355 transition count 462
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 355 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 354 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 354 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 353 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 353 transition count 460
Applied a total of 24 rules in 17 ms. Remains 353 /365 variables (removed 12) and now considering 460/472 (removed 12) transitions.
// Phase 1: matrix 460 rows 353 cols
[2024-06-02 18:16:58] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:16:59] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 18:16:59] [INFO ] Invariant cache hit.
[2024-06-02 18:16:59] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-02 18:16:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (OVERLAPS) 460/813 variables, 353/357 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 18:17:10] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-06-02 18:17:10] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (OVERLAPS) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 359 constraints, problems are : Problem set: 0 solved, 459 unsolved in 29615 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 460/813 variables, 353/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 459/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (OVERLAPS) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 818 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
After SMT, in 59694ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 59698ms
Starting structural reductions in LTL mode, iteration 1 : 353/365 places, 460/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59938 ms. Remains : 353/365 places, 460/472 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-14-LTLFireability-12
Product exploration explored 100000 steps with 27 reset in 88 ms.
Product exploration explored 100000 steps with 20 reset in 122 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 599 edges and 353 vertex of which 350 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (140 resets) in 232 ms. (171 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40000 steps (57 resets) in 478 ms. (83 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (109 resets) in 450 ms. (88 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (271 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (48 resets) in 395 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (51 resets) in 619 ms. (64 steps per ms) remains 5/5 properties
[2024-06-02 18:18:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 16/28 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 61/89 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 210/299 variables, 66/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 273/572 variables, 118/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 185/757 variables, 105/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/757 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 52/809 variables, 34/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/809 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf4 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 4/813 variables, 2/357 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/813 variables, 0/357 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/813 variables, 0/357 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 357 constraints, problems are : Problem set: 1 solved, 4 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 16/28 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 61/89 variables, 28/32 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 210/299 variables, 66/98 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 4/102 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 273/572 variables, 118/220 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 185/757 variables, 105/325 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/757 variables, 0/325 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 52/809 variables, 34/359 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/809 variables, 0/359 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 4/813 variables, 2/361 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/813 variables, 0/361 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/813 variables, 0/361 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 361 constraints, problems are : Problem set: 1 solved, 4 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 922ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 41 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=20 )
Parikh walk visited 4 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (X p0)), (X (X p1)), (G (OR p2 p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0))), (F (NOT (AND p2 p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 304 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Support contains 3 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 460/460 transitions.
Applied a total of 0 rules in 6 ms. Remains 353 /353 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2024-06-02 18:18:02] [INFO ] Invariant cache hit.
[2024-06-02 18:18:02] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 18:18:02] [INFO ] Invariant cache hit.
[2024-06-02 18:18:02] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-02 18:18:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (OVERLAPS) 460/813 variables, 353/357 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 18:18:14] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-06-02 18:18:14] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (OVERLAPS) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 359 constraints, problems are : Problem set: 0 solved, 459 unsolved in 29651 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 460/813 variables, 353/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 459/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (OVERLAPS) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 818 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
After SMT, in 59733ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 59737ms
Finished structural reductions in LTL mode , in 1 iterations and 59980 ms. Remains : 353/353 places, 460/460 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 599 edges and 353 vertex of which 350 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (13 resets) in 49 ms. (800 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (55 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
[2024-06-02 18:19:02] [INFO ] Invariant cache hit.
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 21/33 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/42 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/57 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 164/221 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 373/594 variables, 162/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/594 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 186/780 variables, 121/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/780 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 25/805 variables, 15/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/805 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/813 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/813 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/813 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/12 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 21/33 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/42 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/42 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/57 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 164/221 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 373/594 variables, 162/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/594 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 186/780 variables, 121/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/780 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 25/805 variables, 15/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/805 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 8/813 variables, 4/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/813 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/813 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 358 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 473ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 1 factoid took 276 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 151 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 15 reset in 83 ms.
Product exploration explored 100000 steps with 6 reset in 107 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 161 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 3 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 460/460 transitions.
Graph (trivial) has 380 edges and 353 vertex of which 2 / 353 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 598 edges and 352 vertex of which 349 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 349 transition count 456
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 124 place count 349 transition count 455
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 124 place count 349 transition count 499
Deduced a syphon composed of 167 places in 1 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 170 place count 349 transition count 499
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 195 place count 324 transition count 474
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 220 place count 324 transition count 474
Performed 40 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 182 places in 1 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 260 place count 324 transition count 523
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 267 place count 324 transition count 516
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 287 place count 304 transition count 492
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 3 with 20 rules applied. Total rules applied 307 place count 304 transition count 492
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 309 place count 302 transition count 489
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 311 place count 302 transition count 489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 312 place count 302 transition count 488
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 313 place count 301 transition count 487
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 314 place count 301 transition count 487
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 315 place count 301 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 316 place count 301 transition count 486
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 318 place count 299 transition count 484
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 320 place count 299 transition count 484
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 321 place count 299 transition count 484
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 322 place count 298 transition count 483
Deduced a syphon composed of 164 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 323 place count 298 transition count 483
Performed 54 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 5 with 54 rules applied. Total rules applied 377 place count 298 transition count 700
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 429 place count 298 transition count 648
Discarding 112 places :
Symmetric choice reduction at 6 with 112 rule applications. Total rules 541 place count 186 transition count 395
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 6 with 112 rules applied. Total rules applied 653 place count 186 transition count 395
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 6 with 34 rules applied. Total rules applied 687 place count 186 transition count 361
Discarding 70 places :
Symmetric choice reduction at 7 with 70 rule applications. Total rules 757 place count 116 transition count 236
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 7 with 70 rules applied. Total rules applied 827 place count 116 transition count 236
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 834 place count 116 transition count 229
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 848 place count 102 transition count 201
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 8 with 14 rules applied. Total rules applied 862 place count 102 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 863 place count 102 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 870 place count 102 transition count 219
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 873 place count 99 transition count 201
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 876 place count 99 transition count 201
Deduced a syphon composed of 55 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 888 place count 99 transition count 189
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 889 place count 98 transition count 188
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 890 place count 98 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 891 place count 98 transition count 209
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 892 place count 97 transition count 201
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 893 place count 97 transition count 201
Deduced a syphon composed of 54 places in 0 ms
Applied a total of 893 rules in 64 ms. Remains 97 /353 variables (removed 256) and now considering 201/460 (removed 259) transitions.
[2024-06-02 18:19:04] [INFO ] Redundant transitions in 2 ms returned []
Running 200 sub problems to find dead transitions.
[2024-06-02 18:19:04] [INFO ] Flow matrix only has 196 transitions (discarded 5 similar events)
// Phase 1: matrix 196 rows 97 cols
[2024-06-02 18:19:04] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:19:04] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-06-02 18:19:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 18:19:05] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 18:19:05] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-02 18:19:05] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 188 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
At refinement iteration 4 (OVERLAPS) 195/292 variables, 97/105 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 15/120 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/120 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 1/293 variables, 1/121 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/121 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/293 variables, 0/121 constraints. Problems are: Problem set: 130 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 121 constraints, problems are : Problem set: 130 solved, 70 unsolved in 3409 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 97/97 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 130 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 11/53 variables, 4/4 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 4/8 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 186/239 variables, 53/61 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 15/76 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 70/146 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/146 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 53/292 variables, 44/190 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/190 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/191 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/191 constraints. Problems are: Problem set: 130 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/191 constraints. Problems are: Problem set: 130 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 191 constraints, problems are : Problem set: 130 solved, 70 unsolved in 2499 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 97/97 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 70/200 constraints, Known Traps: 4/4 constraints]
After SMT, in 5945ms problems are : Problem set: 130 solved, 70 unsolved
Search for dead transitions found 130 dead transitions in 5949ms
Found 130 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 130 transitions
Dead transitions reduction (with SMT) removed 130 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 97/353 places, 71/460 transitions.
Graph (complete) has 143 edges and 97 vertex of which 43 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 43 /97 variables (removed 54) and now considering 91/71 (removed -20) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/353 places, 91/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6037 ms. Remains : 43/353 places, 91/460 transitions.
Support contains 3 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 460/460 transitions.
Applied a total of 0 rules in 5 ms. Remains 353 /353 variables (removed 0) and now considering 460/460 (removed 0) transitions.
// Phase 1: matrix 460 rows 353 cols
[2024-06-02 18:19:10] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:19:10] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 18:19:10] [INFO ] Invariant cache hit.
[2024-06-02 18:19:10] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-02 18:19:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (OVERLAPS) 460/813 variables, 353/357 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 18:19:22] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:19:22] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 359 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 460/813 variables, 353/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 459/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (OVERLAPS) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 818 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Finished structural reductions in LTL mode , in 1 iterations and 60370 ms. Remains : 353/353 places, 460/460 transitions.
Treatment of property CO4-PT-14-LTLFireability-12 finished in 191667 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(X(X(F(p0)))))))'
Support contains 1 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 356 transition count 463
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 356 transition count 463
Applied a total of 18 rules in 8 ms. Remains 356 /365 variables (removed 9) and now considering 463/472 (removed 9) transitions.
// Phase 1: matrix 463 rows 356 cols
[2024-06-02 18:20:10] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:20:10] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:20:10] [INFO ] Invariant cache hit.
[2024-06-02 18:20:10] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-02 18:20:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/819 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 18:20:22] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 3 ms to minimize.
[2024-06-02 18:20:22] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.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 0.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 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 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 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.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 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 362 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 463/819 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 462/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 819/819 variables, and 824 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in LTL mode, iteration 1 : 356/365 places, 463/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60354 ms. Remains : 356/365 places, 463/472 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-14
Product exploration explored 100000 steps with 16666 reset in 98 ms.
Product exploration explored 100000 steps with 16666 reset in 99 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 602 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (131 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (118 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14471 steps, run visited all 1 properties in 35 ms. (steps per millisecond=413 )
Probabilistic random walk after 14471 steps, saw 3647 distinct states, run finished after 38 ms. (steps per millisecond=380 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 356/356 places, 463/463 transitions.
Applied a total of 0 rules in 4 ms. Remains 356 /356 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2024-06-02 18:21:12] [INFO ] Invariant cache hit.
[2024-06-02 18:21:12] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 18:21:12] [INFO ] Invariant cache hit.
[2024-06-02 18:21:12] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-02 18:21:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/819 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 18:21:24] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-02 18:21:24] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 362 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 463/819 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 462/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 819/819 variables, and 824 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Finished structural reductions in LTL mode , in 1 iterations and 60380 ms. Remains : 356/356 places, 463/463 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 602 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (36 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (33 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14471 steps, run visited all 1 properties in 34 ms. (steps per millisecond=425 )
Probabilistic random walk after 14471 steps, saw 3647 distinct states, run finished after 34 ms. (steps per millisecond=425 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 95 ms.
Product exploration explored 100000 steps with 16666 reset in 100 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 356/356 places, 463/463 transitions.
Graph (trivial) has 386 edges and 356 vertex of which 2 / 356 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 601 edges and 355 vertex of which 352 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 352 transition count 459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 127 place count 352 transition count 458
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 127 place count 352 transition count 502
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 173 place count 352 transition count 502
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 200 place count 325 transition count 475
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 227 place count 325 transition count 475
Performed 41 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 184 places in 0 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 268 place count 325 transition count 524
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 275 place count 325 transition count 517
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 296 place count 304 transition count 492
Deduced a syphon composed of 168 places in 1 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 317 place count 304 transition count 492
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 319 place count 302 transition count 489
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 321 place count 302 transition count 489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 322 place count 302 transition count 488
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 323 place count 301 transition count 487
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 324 place count 301 transition count 487
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 325 place count 301 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 326 place count 301 transition count 486
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 328 place count 299 transition count 484
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 330 place count 299 transition count 484
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 331 place count 299 transition count 484
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 332 place count 298 transition count 483
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 333 place count 298 transition count 483
Performed 54 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 5 with 54 rules applied. Total rules applied 387 place count 298 transition count 700
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 5 with 49 rules applied. Total rules applied 436 place count 298 transition count 651
Discarding 111 places :
Symmetric choice reduction at 6 with 111 rule applications. Total rules 547 place count 187 transition count 399
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 6 with 111 rules applied. Total rules applied 658 place count 187 transition count 399
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 690 place count 187 transition count 367
Discarding 67 places :
Symmetric choice reduction at 7 with 67 rule applications. Total rules 757 place count 120 transition count 248
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 7 with 67 rules applied. Total rules applied 824 place count 120 transition count 248
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 829 place count 120 transition count 243
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 841 place count 108 transition count 219
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 8 with 12 rules applied. Total rules applied 853 place count 108 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 854 place count 108 transition count 244
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 861 place count 108 transition count 237
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 864 place count 105 transition count 219
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 867 place count 105 transition count 219
Deduced a syphon composed of 60 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 880 place count 105 transition count 206
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 881 place count 104 transition count 205
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 882 place count 104 transition count 205
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 882 rules in 77 ms. Remains 104 /356 variables (removed 252) and now considering 205/463 (removed 258) transitions.
[2024-06-02 18:22:14] [INFO ] Redundant transitions in 5 ms returned []
Running 204 sub problems to find dead transitions.
[2024-06-02 18:22:14] [INFO ] Flow matrix only has 198 transitions (discarded 7 similar events)
// Phase 1: matrix 198 rows 104 cols
[2024-06-02 18:22:14] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:22:14] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 18:22:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 18:22:15] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 18:22:15] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-02 18:22:15] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 192 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
At refinement iteration 4 (OVERLAPS) 197/301 variables, 104/112 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 17/129 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/129 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 1/302 variables, 1/130 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/130 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/302 variables, 0/130 constraints. Problems are: Problem set: 127 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 130 constraints, problems are : Problem set: 127 solved, 77 unsolved in 3612 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 127 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 11/55 variables, 4/4 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 4/8 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 190/245 variables, 55/63 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 17/80 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 77/157 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/157 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 56/301 variables, 49/206 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/206 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 1/302 variables, 1/207 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/207 constraints. Problems are: Problem set: 127 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/302 variables, 0/207 constraints. Problems are: Problem set: 127 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 207 constraints, problems are : Problem set: 127 solved, 77 unsolved in 2872 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 77/204 constraints, Known Traps: 4/4 constraints]
After SMT, in 6523ms problems are : Problem set: 127 solved, 77 unsolved
Search for dead transitions found 127 dead transitions in 6526ms
Found 127 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 127 transitions
Dead transitions reduction (with SMT) removed 127 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 104/356 places, 78/463 transitions.
Graph (complete) has 149 edges and 104 vertex of which 45 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.0 ms
Discarding 59 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 108
Deduced a syphon composed of 2 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 45 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 10 rules in 8 ms. Remains 45 /104 variables (removed 59) and now considering 101/78 (removed -23) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/356 places, 101/463 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6621 ms. Remains : 45/356 places, 101/463 transitions.
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 356/356 places, 463/463 transitions.
Applied a total of 0 rules in 4 ms. Remains 356 /356 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 356 cols
[2024-06-02 18:22:21] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:22:21] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:22:21] [INFO ] Invariant cache hit.
[2024-06-02 18:22:21] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-02 18:22:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/819 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 18:22:33] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:22:33] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 362 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 463/819 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 462/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 819/819 variables, and 824 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in LTL mode , in 1 iterations and 60349 ms. Remains : 356/356 places, 463/463 transitions.
Treatment of property CO4-PT-14-LTLFireability-14 finished in 190775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 394 edges and 365 vertex of which 2 / 365 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 611 edges and 364 vertex of which 361 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 135 place count 360 transition count 334
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 134 rules applied. Total rules applied 269 place count 227 transition count 333
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 269 place count 227 transition count 291
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 353 place count 185 transition count 291
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 355 place count 183 transition count 289
Iterating global reduction 2 with 2 rules applied. Total rules applied 357 place count 183 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 357 place count 183 transition count 288
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 359 place count 182 transition count 288
Performed 61 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 481 place count 121 transition count 216
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 491 place count 121 transition count 206
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 493 place count 120 transition count 205
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 498 place count 115 transition count 200
Iterating global reduction 4 with 5 rules applied. Total rules applied 503 place count 115 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 504 place count 115 transition count 199
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 510 place count 112 transition count 196
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 576 place count 79 transition count 198
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 597 place count 79 transition count 177
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 625 place count 51 transition count 121
Iterating global reduction 6 with 28 rules applied. Total rules applied 653 place count 51 transition count 121
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 672 place count 51 transition count 102
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 679 place count 44 transition count 82
Iterating global reduction 7 with 7 rules applied. Total rules applied 686 place count 44 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 691 place count 44 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 693 place count 43 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 704 place count 43 transition count 83
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 714 place count 43 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 715 place count 42 transition count 82
Applied a total of 715 rules in 37 ms. Remains 42 /365 variables (removed 323) and now considering 82/472 (removed 390) transitions.
[2024-06-02 18:23:21] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
// Phase 1: matrix 72 rows 42 cols
[2024-06-02 18:23:21] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:23:21] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-02 18:23:21] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
[2024-06-02 18:23:21] [INFO ] Invariant cache hit.
[2024-06-02 18:23:21] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 18:23:21] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-02 18:23:21] [INFO ] Redundant transitions in 0 ms returned []
Running 79 sub problems to find dead transitions.
[2024-06-02 18:23:21] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
[2024-06-02 18:23:21] [INFO ] Invariant cache hit.
[2024-06-02 18:23:21] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 71/113 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/114 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/114 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 68 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/42 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 71/113 variables, 42/47 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 79/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/114 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/114 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 147 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1419 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 1/1 constraints]
After SMT, in 2690ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 2692ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/365 places, 82/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2814 ms. Remains : 42/365 places, 82/472 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-14-LTLFireability-15
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-15 finished in 2955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(p1)))||(p0&&X((p1&&X(F(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&(!p1||X(G(p2))))))))'
Found a Shortening insensitive property : CO4-PT-14-LTLFireability-12
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 390 edges and 365 vertex of which 2 / 365 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 611 edges and 364 vertex of which 361 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 360 transition count 338
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 132 rules applied. Total rules applied 263 place count 231 transition count 335
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 265 place count 229 transition count 335
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 265 place count 229 transition count 293
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 349 place count 187 transition count 293
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 352 place count 184 transition count 290
Iterating global reduction 3 with 3 rules applied. Total rules applied 355 place count 184 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 355 place count 184 transition count 289
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 357 place count 183 transition count 289
Performed 62 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 481 place count 121 transition count 213
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 489 place count 121 transition count 205
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 491 place count 120 transition count 204
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 496 place count 115 transition count 199
Iterating global reduction 5 with 5 rules applied. Total rules applied 501 place count 115 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 502 place count 115 transition count 198
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 508 place count 112 transition count 195
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 574 place count 79 transition count 197
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 595 place count 79 transition count 176
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 623 place count 51 transition count 120
Iterating global reduction 7 with 28 rules applied. Total rules applied 651 place count 51 transition count 120
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 670 place count 51 transition count 101
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 677 place count 44 transition count 81
Iterating global reduction 8 with 7 rules applied. Total rules applied 684 place count 44 transition count 81
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 689 place count 44 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 691 place count 43 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 693 place count 41 transition count 91
Applied a total of 693 rules in 23 ms. Remains 41 /365 variables (removed 324) and now considering 91/472 (removed 381) transitions.
[2024-06-02 18:23:24] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
// Phase 1: matrix 82 rows 41 cols
[2024-06-02 18:23:24] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:23:24] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 18:23:24] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2024-06-02 18:23:24] [INFO ] Invariant cache hit.
[2024-06-02 18:23:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 18:23:25] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-06-02 18:23:25] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2024-06-02 18:23:25] [INFO ] Invariant cache hit.
[2024-06-02 18:23:25] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 81/121 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 1/123 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 49 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1201 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 81/121 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 18/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 59/125 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/123 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/123 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 126 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1529 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 2761ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 2761ms
Starting structural reductions in LI_LTL mode, iteration 1 : 41/365 places, 91/472 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2855 ms. Remains : 41/365 places, 91/472 transitions.
Running random walk in product with property : CO4-PT-14-LTLFireability-12
Product exploration explored 100000 steps with 12 reset in 62 ms.
Product exploration explored 100000 steps with 26 reset in 72 ms.
Computed a total of 7 stabilizing places and 17 stable transitions
Computed a total of 7 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (3803 resets) in 69 ms. (571 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (264 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2024-06-02 18:23:28] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2024-06-02 18:23:28] [INFO ] Invariant cache hit.
[2024-06-02 18:23:28] [INFO ] State equation strengthened by 4 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 60/75 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 120/123 variables, and 47 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 40/41 constraints, ReadFeed: 3/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 40ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (X p0)), (X (X p1)), (G (OR p2 p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0))), (F (NOT (AND p2 p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 267 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 91/91 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-06-02 18:23:28] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2024-06-02 18:23:28] [INFO ] Invariant cache hit.
[2024-06-02 18:23:28] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 18:23:28] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2024-06-02 18:23:28] [INFO ] Invariant cache hit.
[2024-06-02 18:23:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 18:23:29] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-06-02 18:23:29] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2024-06-02 18:23:29] [INFO ] Invariant cache hit.
[2024-06-02 18:23:29] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 81/121 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 1/123 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 49 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 81/121 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 18/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 59/125 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/123 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/123 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 126 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 2710ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 2711ms
Finished structural reductions in LTL mode , in 1 iterations and 2792 ms. Remains : 41/41 places, 91/91 transitions.
Computed a total of 7 stabilizing places and 17 stable transitions
Computed a total of 7 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 548 steps (47 resets) in 10 ms. (49 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 1 factoid took 182 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 187 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 45 reset in 50 ms.
Stack based approach found an accepted trace after 26 steps with 2 reset with depth 6 and stack size 6 in 0 ms.
Treatment of property CO4-PT-14-LTLFireability-12 finished in 8158 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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(X(X(F(p0)))))))'
Found a Shortening insensitive property : CO4-PT-14-LTLFireability-14
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 365 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 394 edges and 365 vertex of which 2 / 365 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 611 edges and 364 vertex of which 361 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 360 transition count 335
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 267 place count 228 transition count 334
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 267 place count 228 transition count 292
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 351 place count 186 transition count 292
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 353 place count 184 transition count 290
Iterating global reduction 2 with 2 rules applied. Total rules applied 355 place count 184 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 355 place count 184 transition count 289
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 357 place count 183 transition count 289
Performed 63 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 483 place count 120 transition count 212
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 491 place count 120 transition count 204
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 493 place count 119 transition count 203
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 498 place count 114 transition count 198
Iterating global reduction 4 with 5 rules applied. Total rules applied 503 place count 114 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 504 place count 114 transition count 197
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 510 place count 111 transition count 194
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 576 place count 78 transition count 196
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 596 place count 78 transition count 176
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 623 place count 51 transition count 122
Iterating global reduction 6 with 27 rules applied. Total rules applied 650 place count 51 transition count 122
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 668 place count 51 transition count 104
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 674 place count 45 transition count 87
Iterating global reduction 7 with 6 rules applied. Total rules applied 680 place count 45 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 684 place count 45 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 686 place count 44 transition count 100
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 688 place count 42 transition count 98
Applied a total of 688 rules in 28 ms. Remains 42 /365 variables (removed 323) and now considering 98/472 (removed 374) transitions.
[2024-06-02 18:23:33] [INFO ] Flow matrix only has 86 transitions (discarded 12 similar events)
// Phase 1: matrix 86 rows 42 cols
[2024-06-02 18:23:33] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:23:33] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 18:23:33] [INFO ] Flow matrix only has 86 transitions (discarded 12 similar events)
[2024-06-02 18:23:33] [INFO ] Invariant cache hit.
[2024-06-02 18:23:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:23:33] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-02 18:23:33] [INFO ] Flow matrix only has 86 transitions (discarded 12 similar events)
[2024-06-02 18:23:33] [INFO ] Invariant cache hit.
[2024-06-02 18:23:33] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 85/127 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 1/128 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 49 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1108 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 85/127 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 84/132 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 133 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1367 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 2504ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 2505ms
Starting structural reductions in LI_LTL mode, iteration 1 : 42/365 places, 98/472 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2622 ms. Remains : 42/365 places, 98/472 transitions.
Running random walk in product with property : CO4-PT-14-LTLFireability-14
Product exploration explored 100000 steps with 16640 reset in 196 ms.
Stack based approach found an accepted trace after 10245 steps with 1704 reset with depth 7 and stack size 7 in 16 ms.
Treatment of property CO4-PT-14-LTLFireability-14 finished in 3140 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-06-02 18:23:35] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:23:35] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 18:23:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 365 places, 472 transitions and 1077 arcs took 5 ms.
Total runtime 853591 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CO4-PT-14-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CO4-PT-14-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CO4-PT-14-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CO4-PT-14-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717352616483

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name CO4-PT-14-LTLFireability-02
ltl formula formula --ltl=/tmp/2306/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 365 places, 472 transitions and 1077 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.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2306/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2306/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2306/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2306/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 367 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 366, there are 499 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~48!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 814
pnml2lts-mc( 0/ 4): unique states count: 1276
pnml2lts-mc( 0/ 4): unique transitions count: 2921
pnml2lts-mc( 0/ 4): - self-loop count: 100
pnml2lts-mc( 0/ 4): - claim dead count: 924
pnml2lts-mc( 0/ 4): - claim found count: 239
pnml2lts-mc( 0/ 4): - claim success count: 1287
pnml2lts-mc( 0/ 4): - cum. max stack depth: 203
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1287 states 2949 transitions, fanout: 2.291
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 128700, Transitions per second: 294900
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, 22.5 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 480 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)
ltl formula name CO4-PT-14-LTLFireability-09
ltl formula formula --ltl=/tmp/2306/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 365 places, 472 transitions and 1077 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.040 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2306/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2306/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2306/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2306/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 366 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 366, there are 492 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~63!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 132
pnml2lts-mc( 0/ 4): unique states count: 334
pnml2lts-mc( 0/ 4): unique transitions count: 1470
pnml2lts-mc( 0/ 4): - self-loop count: 42
pnml2lts-mc( 0/ 4): - claim dead count: 330
pnml2lts-mc( 0/ 4): - claim found count: 111
pnml2lts-mc( 0/ 4): - claim success count: 345
pnml2lts-mc( 0/ 4): - cum. max stack depth: 180
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 345 states 1532 transitions, fanout: 4.441
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 34500, Transitions per second: 153200
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, 29.0 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 480 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)
ltl formula name CO4-PT-14-LTLFireability-12
ltl formula formula --ltl=/tmp/2306/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 365 places, 472 transitions and 1077 arcs
Warning: program compiled against libxml 210 using older 209
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.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2306/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2306/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2306/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2306/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 366 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 366, there are 530 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~32!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 76
pnml2lts-mc( 0/ 4): unique states count: 191
pnml2lts-mc( 0/ 4): unique transitions count: 952
pnml2lts-mc( 0/ 4): - self-loop count: 16
pnml2lts-mc( 0/ 4): - claim dead count: 177
pnml2lts-mc( 0/ 4): - claim found count: 14
pnml2lts-mc( 0/ 4): - claim success count: 202
pnml2lts-mc( 0/ 4): - cum. max stack depth: 132
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 202 states 990 transitions, fanout: 4.901
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 20200, Transitions per second: 99000
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, 29.0 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 480 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)
ltl formula name CO4-PT-14-LTLFireability-14
ltl formula formula --ltl=/tmp/2306/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 365 places, 472 transitions and 1077 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2306/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2306/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2306/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2306/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 367 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 366, there are 479 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): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 41
pnml2lts-mc( 0/ 4): unique states count: 41
pnml2lts-mc( 0/ 4): unique transitions count: 62
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 50
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 80
pnml2lts-mc( 0/ 4): - cum. max stack depth: 24
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 80 states 154 transitions, fanout: 1.925
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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, 55.2 B/state, compr.: 3.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 480 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="CO4-PT-14"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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