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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 5.8K 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 4.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K 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 71K 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 255K 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-15-LTLFireability-00
FORMULA_NAME CO4-PT-15-LTLFireability-01
FORMULA_NAME CO4-PT-15-LTLFireability-02
FORMULA_NAME CO4-PT-15-LTLFireability-03
FORMULA_NAME CO4-PT-15-LTLFireability-04
FORMULA_NAME CO4-PT-15-LTLFireability-05
FORMULA_NAME CO4-PT-15-LTLFireability-06
FORMULA_NAME CO4-PT-15-LTLFireability-07
FORMULA_NAME CO4-PT-15-LTLFireability-08
FORMULA_NAME CO4-PT-15-LTLFireability-09
FORMULA_NAME CO4-PT-15-LTLFireability-10
FORMULA_NAME CO4-PT-15-LTLFireability-11
FORMULA_NAME CO4-PT-15-LTLFireability-12
FORMULA_NAME CO4-PT-15-LTLFireability-13
FORMULA_NAME CO4-PT-15-LTLFireability-14
FORMULA_NAME CO4-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717351820213

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-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:10:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:10:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:10:21] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-06-02 18:10:21] [INFO ] Transformed 833 places.
[2024-06-02 18:10:21] [INFO ] Transformed 1106 transitions.
[2024-06-02 18:10:21] [INFO ] Found NUPN structural information;
[2024-06-02 18:10:21] [INFO ] Parsed PT model containing 833 places and 1106 transitions and 2980 arcs in 217 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 1 formulas.
Deduced a syphon composed of 124 places in 11 ms
Reduce places removed 124 places and 197 transitions.
FORMULA CO4-PT-15-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 909/909 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 689 transition count 906
Discarding 158 places :
Symmetric choice reduction at 1 with 158 rule applications. Total rules 181 place count 531 transition count 746
Iterating global reduction 1 with 158 rules applied. Total rules applied 339 place count 531 transition count 746
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 346 place count 531 transition count 739
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 423 place count 454 transition count 652
Iterating global reduction 2 with 77 rules applied. Total rules applied 500 place count 454 transition count 652
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 502 place count 454 transition count 650
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 517 place count 439 transition count 628
Iterating global reduction 3 with 15 rules applied. Total rules applied 532 place count 439 transition count 628
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 534 place count 439 transition count 626
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 541 place count 432 transition count 619
Iterating global reduction 4 with 7 rules applied. Total rules applied 548 place count 432 transition count 619
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 553 place count 427 transition count 614
Iterating global reduction 4 with 5 rules applied. Total rules applied 558 place count 427 transition count 614
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 563 place count 427 transition count 609
Applied a total of 563 rules in 149 ms. Remains 427 /709 variables (removed 282) and now considering 609/909 (removed 300) transitions.
// Phase 1: matrix 609 rows 427 cols
[2024-06-02 18:10:22] [INFO ] Computed 7 invariants in 24 ms
[2024-06-02 18:10:22] [INFO ] Implicit Places using invariants in 282 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 311 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 426/709 places, 609/909 transitions.
Applied a total of 0 rules in 11 ms. Remains 426 /426 variables (removed 0) and now considering 609/609 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 487 ms. Remains : 426/709 places, 609/909 transitions.
Support contains 33 out of 426 places after structural reductions.
[2024-06-02 18:10:22] [INFO ] Flatten gal took : 65 ms
[2024-06-02 18:10:22] [INFO ] Flatten gal took : 32 ms
[2024-06-02 18:10:22] [INFO ] Input system was already deterministic with 609 transitions.
Support contains 31 out of 426 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (885 resets) in 2162 ms. (18 steps per ms) remains 15/26 properties
BEST_FIRST walk for 4003 steps (15 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (13 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (15 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (14 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (13 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (15 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (13 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
// Phase 1: matrix 609 rows 426 cols
[2024-06-02 18:10:23] [INFO ] Computed 6 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 14/49 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 161/210 variables, 49/55 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 434/644 variables, 147/202 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 331/975 variables, 187/389 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/975 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 53/1028 variables, 38/427 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1028 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 7/1035 variables, 5/432 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1035 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/1035 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1035/1035 variables, and 432 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1232 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 14/49 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 161/210 variables, 49/55 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 434/644 variables, 147/203 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/644 variables, 14/217 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/644 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 331/975 variables, 187/404 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/975 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 53/1028 variables, 38/442 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1028 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 7/1035 variables, 5/447 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1035 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/1035 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1035/1035 variables, and 447 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1795 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 3080ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 14 properties in 1665 ms.
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 609/609 transitions.
Graph (trivial) has 461 edges and 426 vertex of which 2 / 426 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 907 edges and 425 vertex of which 403 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 174 rules applied. Total rules applied 176 place count 403 transition count 413
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 160 rules applied. Total rules applied 336 place count 246 transition count 410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 337 place count 245 transition count 410
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 337 place count 245 transition count 365
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 427 place count 200 transition count 365
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 434 place count 193 transition count 356
Iterating global reduction 3 with 7 rules applied. Total rules applied 441 place count 193 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 443 place count 193 transition count 354
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 443 place count 193 transition count 353
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 445 place count 192 transition count 353
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 447 place count 190 transition count 351
Iterating global reduction 4 with 2 rules applied. Total rules applied 449 place count 190 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 450 place count 190 transition count 350
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 451 place count 189 transition count 349
Iterating global reduction 5 with 1 rules applied. Total rules applied 452 place count 189 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 453 place count 189 transition count 348
Performed 64 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 6 with 128 rules applied. Total rules applied 581 place count 125 transition count 269
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 18 rules applied. Total rules applied 599 place count 125 transition count 251
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 603 place count 123 transition count 249
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 607 place count 119 transition count 241
Iterating global reduction 8 with 4 rules applied. Total rules applied 611 place count 119 transition count 241
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 8 with 6 rules applied. Total rules applied 617 place count 116 transition count 238
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 618 place count 116 transition count 237
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 619 place count 115 transition count 235
Iterating global reduction 9 with 1 rules applied. Total rules applied 620 place count 115 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 621 place count 115 transition count 234
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 10 with 78 rules applied. Total rules applied 699 place count 76 transition count 275
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 10 with 59 rules applied. Total rules applied 758 place count 76 transition count 216
Discarding 28 places :
Symmetric choice reduction at 11 with 28 rule applications. Total rules 786 place count 48 transition count 132
Iterating global reduction 11 with 28 rules applied. Total rules applied 814 place count 48 transition count 132
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 833 place count 48 transition count 113
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 840 place count 41 transition count 81
Iterating global reduction 12 with 7 rules applied. Total rules applied 847 place count 41 transition count 81
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 852 place count 41 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 856 place count 39 transition count 99
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 862 place count 39 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 14 with 13 rules applied. Total rules applied 875 place count 39 transition count 80
Free-agglomeration rule applied 8 times.
Iterating global reduction 14 with 8 rules applied. Total rules applied 883 place count 39 transition count 72
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 893 place count 31 transition count 70
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 894 place count 31 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 895 place count 30 transition count 69
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 t323.t489 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 17 edges and 26 vertex of which 3 / 26 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 15 with 3 rules applied. Total rules applied 898 place count 24 transition count 67
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 17 edges and 23 vertex of which 6 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 16 with 8 rules applied. Total rules applied 906 place count 18 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 17 with 23 rules applied. Total rules applied 929 place count 18 transition count 38
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 930 place count 17 transition count 34
Iterating global reduction 18 with 1 rules applied. Total rules applied 931 place count 17 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 932 place count 17 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 19 with 5 rules applied. Total rules applied 937 place count 17 transition count 28
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 47 edges and 16 vertex of which 15 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 19 with 3 rules applied. Total rules applied 940 place count 15 transition count 27
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 941 place count 14 transition count 24
Iterating global reduction 20 with 1 rules applied. Total rules applied 942 place count 14 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 943 place count 14 transition count 23
Free-agglomeration rule applied 2 times.
Iterating global reduction 21 with 2 rules applied. Total rules applied 945 place count 14 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 947 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 22 with 4 rules applied. Total rules applied 951 place count 12 transition count 17
Applied a total of 951 rules in 102 ms. Remains 12 /426 variables (removed 414) and now considering 17/609 (removed 592) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 12/426 places, 17/609 transitions.
RANDOM walk for 33 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
FORMULA CO4-PT-15-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 909 edges and 426 vertex of which 423 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 2 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 411 transition count 591
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 411 transition count 591
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 411 transition count 589
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 405 transition count 583
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 405 transition count 583
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 403 transition count 581
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 403 transition count 581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 403 transition count 580
Applied a total of 49 rules in 20 ms. Remains 403 /426 variables (removed 23) and now considering 580/609 (removed 29) transitions.
// Phase 1: matrix 580 rows 403 cols
[2024-06-02 18:10:28] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 18:10:28] [INFO ] Implicit Places using invariants in 87 ms returned [346]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 402/426 places, 580/609 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 580/580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 402/426 places, 580/609 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-15-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 853 edges and 402 vertex of which 399 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-15-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-15-LTLFireability-00 finished in 845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 410 transition count 590
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 410 transition count 590
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 410 transition count 588
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 403 transition count 581
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 403 transition count 581
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 401 transition count 579
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 401 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 401 transition count 578
Applied a total of 53 rules in 22 ms. Remains 401 /426 variables (removed 25) and now considering 578/609 (removed 31) transitions.
// Phase 1: matrix 578 rows 401 cols
[2024-06-02 18:10:29] [INFO ] Computed 6 invariants in 5 ms
[2024-06-02 18:10:29] [INFO ] Implicit Places using invariants in 112 ms returned [345]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/426 places, 578/609 transitions.
Applied a total of 0 rules in 4 ms. Remains 400 /400 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 400/426 places, 578/609 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLFireability-01
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA CO4-PT-15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLFireability-01 finished in 254 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) U (p1&&G(p0)))))'
Support contains 4 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 412 transition count 593
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 412 transition count 593
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 412 transition count 592
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 406 transition count 586
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 406 transition count 586
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 404 transition count 584
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 404 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 404 transition count 583
Applied a total of 46 rules in 17 ms. Remains 404 /426 variables (removed 22) and now considering 583/609 (removed 26) transitions.
// Phase 1: matrix 583 rows 404 cols
[2024-06-02 18:10:29] [INFO ] Computed 6 invariants in 4 ms
[2024-06-02 18:10:29] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 18:10:29] [INFO ] Invariant cache hit.
[2024-06-02 18:10:30] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 582 sub problems to find dead transitions.
[2024-06-02 18:10:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-06-02 18:10:40] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 10 ms to minimize.
[2024-06-02 18:10:40] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (OVERLAPS) 583/987 variables, 404/412 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-06-02 18:10:48] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-06-02 18:10:48] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/987 variables, and 414 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (OVERLAPS) 583/987 variables, 404/414 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 582/996 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 996 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 4/4 constraints]
After SMT, in 60272ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60284ms
Starting structural reductions in LTL mode, iteration 1 : 404/426 places, 583/609 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60660 ms. Remains : 404/426 places, 583/609 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-15-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLFireability-02 finished in 60808 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||G(p1)||X(p2))) U (!p2&&G((p0||G(p1)||X(p2)))))))'
Support contains 3 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 411 transition count 591
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 411 transition count 591
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 411 transition count 589
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 404 transition count 582
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 404 transition count 582
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 402 transition count 580
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 402 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 402 transition count 579
Applied a total of 51 rules in 16 ms. Remains 402 /426 variables (removed 24) and now considering 579/609 (removed 30) transitions.
// Phase 1: matrix 579 rows 402 cols
[2024-06-02 18:11:30] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 18:11:30] [INFO ] Implicit Places using invariants in 97 ms returned [346]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/426 places, 579/609 transitions.
Applied a total of 0 rules in 4 ms. Remains 401 /401 variables (removed 0) and now considering 579/579 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 401/426 places, 579/609 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : CO4-PT-15-LTLFireability-03
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 0 ms.
FORMULA CO4-PT-15-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLFireability-03 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 410 transition count 590
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 410 transition count 590
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 410 transition count 588
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 403 transition count 581
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 403 transition count 581
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 401 transition count 579
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 401 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 401 transition count 578
Applied a total of 53 rules in 22 ms. Remains 401 /426 variables (removed 25) and now considering 578/609 (removed 31) transitions.
// Phase 1: matrix 578 rows 401 cols
[2024-06-02 18:11:30] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 18:11:31] [INFO ] Implicit Places using invariants in 94 ms returned [345]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/426 places, 578/609 transitions.
Applied a total of 0 rules in 4 ms. Remains 400 /400 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 400/426 places, 578/609 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-15-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 851 edges and 400 vertex of which 397 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-15-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-15-LTLFireability-04 finished in 691 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||X(p1)))||G(p2))))'
Support contains 4 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 413 transition count 594
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 413 transition count 594
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 413 transition count 592
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 407 transition count 586
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 407 transition count 586
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 405 transition count 584
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 405 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 405 transition count 583
Applied a total of 45 rules in 32 ms. Remains 405 /426 variables (removed 21) and now considering 583/609 (removed 26) transitions.
// Phase 1: matrix 583 rows 405 cols
[2024-06-02 18:11:31] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:11:31] [INFO ] Implicit Places using invariants in 117 ms returned [349]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 404/426 places, 583/609 transitions.
Applied a total of 0 rules in 5 ms. Remains 404 /404 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 404/426 places, 583/609 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CO4-PT-15-LTLFireability-05
Product exploration explored 100000 steps with 163 reset in 86 ms.
Product exploration explored 100000 steps with 2230 reset in 191 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 857 edges and 404 vertex of which 401 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 120 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (703 resets) in 373 ms. (106 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (14 resets) in 8 ms. (444 steps per ms) remains 10/15 properties
BEST_FIRST walk for 4003 steps (14 resets) in 8 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4001 steps (15 resets) in 10 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (13 resets) in 7 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 10/10 properties
// Phase 1: matrix 583 rows 404 cols
[2024-06-02 18:11:32] [INFO ] Computed 5 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 19/34 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 134/168 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 413/581 variables, 136/175 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 342/923 variables, 188/363 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/923 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 57/980 variables, 41/404 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 7/987 variables, 5/409 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/987 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/987 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 987/987 variables, and 409 constraints, problems are : Problem set: 0 solved, 10 unsolved in 716 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 19/34 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 18:11:33] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 134/168 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 413/581 variables, 136/176 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 10/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 342/923 variables, 188/374 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/923 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 57/980 variables, 41/415 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/980 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 7/987 variables, 5/420 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/987 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/987 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 987/987 variables, and 420 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 2043ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 6 different solutions.
Finished Parikh walk after 238 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=119 )
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 )
Parikh walk visited 10 properties in 143 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1)))]
Knowledge based reduction with 31 factoid took 551 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 583/583 transitions.
Applied a total of 0 rules in 4 ms. Remains 404 /404 variables (removed 0) and now considering 583/583 (removed 0) transitions.
[2024-06-02 18:11:35] [INFO ] Invariant cache hit.
[2024-06-02 18:11:35] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 18:11:35] [INFO ] Invariant cache hit.
[2024-06-02 18:11:35] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 582 sub problems to find dead transitions.
[2024-06-02 18:11:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (OVERLAPS) 583/987 variables, 404/409 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-06-02 18:11:52] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-06-02 18:11:52] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/987 variables, and 411 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-06-02 18:12:12] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 5 (OVERLAPS) 583/987 variables, 404/412 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 582/994 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-06-02 18:12:26] [INFO ] Deduced a trap composed of 153 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/987 variables, 1/995 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 995 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 4/4 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Finished structural reductions in LTL mode , in 1 iterations and 60568 ms. Remains : 404/404 places, 583/583 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 857 edges and 404 vertex of which 401 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 205 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (863 resets) in 315 ms. (126 steps per ms) remains 10/15 properties
BEST_FIRST walk for 40002 steps (158 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (160 resets) in 144 ms. (275 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (99 resets) in 111 ms. (357 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40003 steps (143 resets) in 187 ms. (212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (155 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (92 resets) in 39 ms. (1000 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (91 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (100 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (100 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
[2024-06-02 18:12:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 19/34 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 134/168 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 413/581 variables, 136/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 342/923 variables, 188/363 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/923 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 57/980 variables, 41/404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 7/987 variables, 5/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/987 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/987 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 987/987 variables, and 409 constraints, problems are : Problem set: 0 solved, 7 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 19/34 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 134/168 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 413/581 variables, 136/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 7/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 342/923 variables, 188/370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/923 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 57/980 variables, 41/411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/980 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 7/987 variables, 5/416 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/987 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/987 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 987/987 variables, and 416 constraints, problems are : Problem set: 0 solved, 7 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1417ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 2849 steps, including 37 resets, run visited all 1 properties in 5 ms. (steps per millisecond=569 )
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 )
Parikh walk visited 7 properties in 234 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1)))]
Knowledge based reduction with 31 factoid took 574 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1082 reset in 111 ms.
Product exploration explored 100000 steps with 153 reset in 112 ms.
Support contains 4 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 583/583 transitions.
Applied a total of 0 rules in 8 ms. Remains 404 /404 variables (removed 0) and now considering 583/583 (removed 0) transitions.
[2024-06-02 18:12:39] [INFO ] Invariant cache hit.
[2024-06-02 18:12:39] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 18:12:39] [INFO ] Invariant cache hit.
[2024-06-02 18:12:40] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 582 sub problems to find dead transitions.
[2024-06-02 18:12:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (OVERLAPS) 583/987 variables, 404/409 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-06-02 18:12:56] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:12:56] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/987 variables, and 411 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-06-02 18:13:16] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 5 (OVERLAPS) 583/987 variables, 404/412 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 582/994 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-06-02 18:13:31] [INFO ] Deduced a trap composed of 153 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/987 variables, 1/995 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 995 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 4/4 constraints]
After SMT, in 60204ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Finished structural reductions in LTL mode , in 1 iterations and 60540 ms. Remains : 404/404 places, 583/583 transitions.
Treatment of property CO4-PT-15-LTLFireability-05 finished in 128858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0)) U (p1&&F(p2)))))))'
Support contains 3 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 411 transition count 591
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 411 transition count 591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 411 transition count 590
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 404 transition count 583
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 404 transition count 583
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 402 transition count 581
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 402 transition count 581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 402 transition count 580
Applied a total of 50 rules in 21 ms. Remains 402 /426 variables (removed 24) and now considering 580/609 (removed 29) transitions.
// Phase 1: matrix 580 rows 402 cols
[2024-06-02 18:13:40] [INFO ] Computed 6 invariants in 4 ms
[2024-06-02 18:13:40] [INFO ] Implicit Places using invariants in 96 ms returned [346]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/426 places, 580/609 transitions.
Applied a total of 0 rules in 3 ms. Remains 401 /401 variables (removed 0) and now considering 580/580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 401/426 places, 580/609 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : CO4-PT-15-LTLFireability-06
Product exploration explored 100000 steps with 25000 reset in 109 ms.
Product exploration explored 100000 steps with 25000 reset in 112 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 853 edges and 401 vertex of which 398 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
RANDOM walk for 40000 steps (700 resets) in 269 ms. (148 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (153 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (157 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (157 resets) in 28 ms. (1379 steps per ms) remains 3/3 properties
// Phase 1: matrix 580 rows 401 cols
[2024-06-02 18:13:41] [INFO ] Computed 5 invariants in 2 ms
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 45/55 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 195/250 variables, 42/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 16/266 variables, 3/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 5/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/274 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 306/580 variables, 141/203 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/580 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 283/863 variables, 127/330 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/863 variables, 0/330 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 101/964 variables, 66/396 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/964 variables, 0/396 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 13/977 variables, 8/404 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/977 variables, 0/404 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 4/981 variables, 2/406 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/981 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/981 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 981/981 variables, and 406 constraints, problems are : Problem set: 1 solved, 2 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/46 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 193/239 variables, 40/49 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/255 variables, 3/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 5/57 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/263 variables, 2/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 307/570 variables, 141/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/570 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 290/860 variables, 130/330 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/860 variables, 0/330 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 104/964 variables, 68/398 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/964 variables, 0/398 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 13/977 variables, 8/406 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/977 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 4/981 variables, 2/408 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/981 variables, 0/408 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/981 variables, 0/408 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 981/981 variables, and 408 constraints, problems are : Problem set: 1 solved, 2 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 773ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 24 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 2 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (G (OR p0 p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 2 factoid took 205 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (NOT p2)]
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 580/580 transitions.
Applied a total of 0 rules in 9 ms. Remains 401 /401 variables (removed 0) and now considering 580/580 (removed 0) transitions.
[2024-06-02 18:13:43] [INFO ] Invariant cache hit.
[2024-06-02 18:13:43] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 18:13:43] [INFO ] Invariant cache hit.
[2024-06-02 18:13:43] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 579 sub problems to find dead transitions.
[2024-06-02 18:13:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 18:13:53] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/981 variables, 401/407 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 18:14:00] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:14:00] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/981 variables, and 409 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/981 variables, 401/409 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 579/988 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 18:14:31] [INFO ] Deduced a trap composed of 157 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:14:31] [INFO ] Deduced a trap composed of 153 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/981 variables, 2/990 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 990 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 5/5 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 579 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Finished structural reductions in LTL mode , in 1 iterations and 60527 ms. Remains : 401/401 places, 580/580 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 853 edges and 401 vertex of which 398 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (NOT p2)]
RANDOM walk for 40000 steps (884 resets) in 106 ms. (373 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p2 (NOT p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F p0)]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 25000 reset in 108 ms.
Product exploration explored 100000 steps with 25000 reset in 108 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (NOT p2)]
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 580/580 transitions.
Graph (trivial) has 434 edges and 401 vertex of which 2 / 401 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 852 edges and 400 vertex of which 397 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
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 143 rules applied. Total rules applied 145 place count 397 transition count 573
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 148 place count 397 transition count 570
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 148 place count 397 transition count 615
Deduced a syphon composed of 186 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 194 place count 397 transition count 615
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 227 place count 364 transition count 582
Deduced a syphon composed of 153 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 260 place count 364 transition count 582
Performed 48 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 201 places in 0 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 308 place count 364 transition count 619
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 321 place count 364 transition count 606
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 348 place count 337 transition count 575
Deduced a syphon composed of 178 places in 0 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 375 place count 337 transition count 575
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 379 place count 337 transition count 575
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 382 place count 337 transition count 572
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 390 place count 329 transition count 563
Deduced a syphon composed of 175 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 398 place count 329 transition count 563
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 400 place count 327 transition count 560
Deduced a syphon composed of 174 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 402 place count 327 transition count 560
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 403 place count 327 transition count 559
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 404 place count 326 transition count 558
Deduced a syphon composed of 173 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 405 place count 326 transition count 558
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 408 place count 326 transition count 558
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 411 place count 323 transition count 555
Deduced a syphon composed of 173 places in 0 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 414 place count 323 transition count 555
Performed 57 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 5 with 57 rules applied. Total rules applied 471 place count 323 transition count 825
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 5 with 46 rules applied. Total rules applied 517 place count 323 transition count 779
Discarding 114 places :
Symmetric choice reduction at 6 with 114 rule applications. Total rules 631 place count 209 transition count 467
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 6 with 114 rules applied. Total rules applied 745 place count 209 transition count 467
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 774 place count 209 transition count 438
Discarding 67 places :
Symmetric choice reduction at 7 with 67 rule applications. Total rules 841 place count 142 transition count 300
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 7 with 67 rules applied. Total rules applied 908 place count 142 transition count 300
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 914 place count 142 transition count 294
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 926 place count 130 transition count 270
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 8 with 12 rules applied. Total rules applied 938 place count 130 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 939 place count 130 transition count 295
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 946 place count 130 transition count 288
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 949 place count 127 transition count 270
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 952 place count 127 transition count 270
Deduced a syphon composed of 69 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 978 place count 127 transition count 244
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 979 place count 126 transition count 243
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 980 place count 126 transition count 243
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 981 place count 126 transition count 264
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 982 place count 125 transition count 256
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 983 place count 125 transition count 256
Deduced a syphon composed of 68 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 985 place count 125 transition count 254
Deduced a syphon composed of 68 places in 0 ms
Applied a total of 985 rules in 143 ms. Remains 125 /401 variables (removed 276) and now considering 254/580 (removed 326) transitions.
[2024-06-02 18:14:46] [INFO ] Redundant transitions in 10 ms returned []
Running 253 sub problems to find dead transitions.
[2024-06-02 18:14:46] [INFO ] Flow matrix only has 235 transitions (discarded 19 similar events)
// Phase 1: matrix 235 rows 125 cols
[2024-06-02 18:14:46] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:14:46] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 18:14:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 18:14:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-02 18:14:47] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-02 18:14:47] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-02 18:14:47] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 5/10 constraints. Problems are: Problem set: 13 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/10 constraints. Problems are: Problem set: 13 solved, 240 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD142 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 TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 4 (OVERLAPS) 234/359 variables, 125/135 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 29/164 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/164 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 1/360 variables, 1/165 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/165 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/360 variables, 0/165 constraints. Problems are: Problem set: 143 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 165 constraints, problems are : Problem set: 143 solved, 110 unsolved in 5576 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 143 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 14/70 variables, 5/5 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 5/10 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 225/295 variables, 70/80 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 29/109 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 110/219 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/219 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 64/359 variables, 55/274 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/274 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 1/360 variables, 1/275 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/275 constraints. Problems are: Problem set: 143 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/360 variables, 0/275 constraints. Problems are: Problem set: 143 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 275 constraints, problems are : Problem set: 143 solved, 110 unsolved in 4686 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 110/253 constraints, Known Traps: 5/5 constraints]
After SMT, in 10369ms problems are : Problem set: 143 solved, 110 unsolved
Search for dead transitions found 143 dead transitions in 10372ms
Found 143 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 143 transitions
Dead transitions reduction (with SMT) removed 143 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 125/401 places, 111/580 transitions.
Graph (complete) has 232 edges and 125 vertex of which 57 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.5 ms
Discarding 68 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 57 transition count 131
Deduced a syphon composed of 1 places in 1 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 9 place count 57 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 9 rules in 21 ms. Remains 57 /125 variables (removed 68) and now considering 124/111 (removed -13) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/401 places, 124/580 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10581 ms. Remains : 57/401 places, 124/580 transitions.
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 580/580 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 580/580 (removed 0) transitions.
// Phase 1: matrix 580 rows 401 cols
[2024-06-02 18:14:56] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:14:56] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-02 18:14:56] [INFO ] Invariant cache hit.
[2024-06-02 18:14:56] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 579 sub problems to find dead transitions.
[2024-06-02 18:14:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 18:15:06] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/981 variables, 401/407 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 18:15:14] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:15:14] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/981 variables, and 409 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/981 variables, 401/409 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 579/988 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 18:15:43] [INFO ] Deduced a trap composed of 157 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:15:43] [INFO ] Deduced a trap composed of 153 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/981 variables, 2/990 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 990 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 5/5 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 579 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Finished structural reductions in LTL mode , in 1 iterations and 60571 ms. Remains : 401/401 places, 580/580 transitions.
Treatment of property CO4-PT-15-LTLFireability-06 finished in 136718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Graph (trivial) has 462 edges and 426 vertex of which 2 / 426 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 908 edges and 425 vertex of which 422 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.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 162 rules applied. Total rules applied 164 place count 421 transition count 442
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 162 rules applied. Total rules applied 326 place count 262 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 327 place count 261 transition count 439
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 327 place count 261 transition count 393
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 419 place count 215 transition count 393
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 426 place count 208 transition count 383
Iterating global reduction 3 with 7 rules applied. Total rules applied 433 place count 208 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 435 place count 208 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 435 place count 208 transition count 380
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 437 place count 207 transition count 380
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 438 place count 206 transition count 379
Iterating global reduction 4 with 1 rules applied. Total rules applied 439 place count 206 transition count 379
Performed 65 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 569 place count 141 transition count 298
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 17 rules applied. Total rules applied 586 place count 141 transition count 281
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 590 place count 139 transition count 279
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 594 place count 135 transition count 271
Iterating global reduction 6 with 4 rules applied. Total rules applied 598 place count 135 transition count 271
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 606 place count 131 transition count 267
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 607 place count 130 transition count 265
Iterating global reduction 6 with 1 rules applied. Total rules applied 608 place count 130 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 609 place count 130 transition count 264
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 691 place count 89 transition count 310
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 711 place count 89 transition count 290
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 739 place count 61 transition count 178
Iterating global reduction 8 with 28 rules applied. Total rules applied 767 place count 61 transition count 178
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 785 place count 61 transition count 160
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 792 place count 54 transition count 122
Iterating global reduction 9 with 7 rules applied. Total rules applied 799 place count 54 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 804 place count 54 transition count 117
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 10 with 2 rules applied. Total rules applied 806 place count 53 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 10 with 20 rules applied. Total rules applied 826 place count 53 transition count 114
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 827 place count 53 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 829 place count 51 transition count 112
Applied a total of 829 rules in 51 ms. Remains 51 /426 variables (removed 375) and now considering 112/609 (removed 497) transitions.
[2024-06-02 18:15:57] [INFO ] Flow matrix only has 84 transitions (discarded 28 similar events)
// Phase 1: matrix 84 rows 51 cols
[2024-06-02 18:15:57] [INFO ] Computed 6 invariants in 0 ms
[2024-06-02 18:15:57] [INFO ] Implicit Places using invariants in 40 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/426 places, 112/609 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 50/426 places, 112/609 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLFireability-07
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLFireability-07 finished in 171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 410 transition count 590
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 410 transition count 590
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 410 transition count 588
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 403 transition count 581
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 403 transition count 581
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 401 transition count 579
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 401 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 401 transition count 578
Applied a total of 53 rules in 18 ms. Remains 401 /426 variables (removed 25) and now considering 578/609 (removed 31) transitions.
// Phase 1: matrix 578 rows 401 cols
[2024-06-02 18:15:57] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 18:15:57] [INFO ] Implicit Places using invariants in 85 ms returned [345]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/426 places, 578/609 transitions.
Applied a total of 0 rules in 4 ms. Remains 400 /400 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 400/426 places, 578/609 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLFireability-08
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 0 ms.
FORMULA CO4-PT-15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLFireability-08 finished in 174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Graph (trivial) has 462 edges and 426 vertex of which 2 / 426 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 908 edges and 425 vertex of which 422 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.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 162 rules applied. Total rules applied 164 place count 421 transition count 442
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 162 rules applied. Total rules applied 326 place count 262 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 327 place count 261 transition count 439
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 327 place count 261 transition count 393
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 419 place count 215 transition count 393
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 426 place count 208 transition count 383
Iterating global reduction 3 with 7 rules applied. Total rules applied 433 place count 208 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 435 place count 208 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 435 place count 208 transition count 380
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 437 place count 207 transition count 380
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 438 place count 206 transition count 379
Iterating global reduction 4 with 1 rules applied. Total rules applied 439 place count 206 transition count 379
Performed 65 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 569 place count 141 transition count 297
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 16 rules applied. Total rules applied 585 place count 141 transition count 281
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 589 place count 139 transition count 279
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 593 place count 135 transition count 271
Iterating global reduction 6 with 4 rules applied. Total rules applied 597 place count 135 transition count 271
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 605 place count 131 transition count 267
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 606 place count 130 transition count 265
Iterating global reduction 6 with 1 rules applied. Total rules applied 607 place count 130 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 608 place count 130 transition count 264
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 690 place count 89 transition count 310
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 710 place count 89 transition count 290
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 738 place count 61 transition count 178
Iterating global reduction 8 with 28 rules applied. Total rules applied 766 place count 61 transition count 178
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 784 place count 61 transition count 160
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 791 place count 54 transition count 122
Iterating global reduction 9 with 7 rules applied. Total rules applied 798 place count 54 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 803 place count 54 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 817 place count 54 transition count 103
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 10 with 2 rules applied. Total rules applied 819 place count 53 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 821 place count 51 transition count 109
Applied a total of 821 rules in 53 ms. Remains 51 /426 variables (removed 375) and now considering 109/609 (removed 500) transitions.
[2024-06-02 18:15:57] [INFO ] Flow matrix only has 90 transitions (discarded 19 similar events)
// Phase 1: matrix 90 rows 51 cols
[2024-06-02 18:15:57] [INFO ] Computed 6 invariants in 0 ms
[2024-06-02 18:15:57] [INFO ] Implicit Places using invariants in 119 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/426 places, 109/609 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 50/426 places, 109/609 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLFireability-09
Product exploration explored 100000 steps with 309 reset in 97 ms.
Product exploration explored 100000 steps with 98 reset in 59 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2487 steps (200 resets) in 16 ms. (146 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 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-06-02 18:15:58] [INFO ] Flow matrix only has 90 transitions (discarded 19 similar events)
// Phase 1: matrix 90 rows 50 cols
[2024-06-02 18:15:58] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:15:58] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 18:15:58] [INFO ] Flow matrix only has 90 transitions (discarded 19 similar events)
[2024-06-02 18:15:58] [INFO ] Invariant cache hit.
[2024-06-02 18:15:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:15:58] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-06-02 18:15:58] [INFO ] Redundant transitions in 0 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-02 18:15:58] [INFO ] Flow matrix only has 90 transitions (discarded 19 similar events)
[2024-06-02 18:15:58] [INFO ] Invariant cache hit.
[2024-06-02 18:15:58] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 89/139 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/140 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 58 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1236 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 89/139 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 89/146 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 1/140 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 147 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1438 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 2713ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 2716ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2826 ms. Remains : 50/50 places, 109/109 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4298 steps (348 resets) in 17 ms. (238 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 336 reset in 35 ms.
Product exploration explored 100000 steps with 199 reset in 61 ms.
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 109/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-06-02 18:16:01] [INFO ] Flow matrix only has 90 transitions (discarded 19 similar events)
[2024-06-02 18:16:01] [INFO ] Invariant cache hit.
[2024-06-02 18:16:01] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 18:16:01] [INFO ] Flow matrix only has 90 transitions (discarded 19 similar events)
[2024-06-02 18:16:01] [INFO ] Invariant cache hit.
[2024-06-02 18:16:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:16:01] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-06-02 18:16:01] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-02 18:16:01] [INFO ] Flow matrix only has 90 transitions (discarded 19 similar events)
[2024-06-02 18:16:01] [INFO ] Invariant cache hit.
[2024-06-02 18:16:01] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 89/139 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/140 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 58 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1181 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 89/139 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 89/146 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 1/140 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 147 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1469 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 2678ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 2679ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2779 ms. Remains : 50/50 places, 109/109 transitions.
Treatment of property CO4-PT-15-LTLFireability-09 finished in 7033 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)||G(p1))))'
Support contains 3 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Graph (trivial) has 458 edges and 426 vertex of which 2 / 426 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 908 edges and 425 vertex of which 422 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.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 157 rules applied. Total rules applied 159 place count 421 transition count 447
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 157 rules applied. Total rules applied 316 place count 267 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 317 place count 266 transition count 444
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 317 place count 266 transition count 398
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 409 place count 220 transition count 398
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 416 place count 213 transition count 388
Iterating global reduction 3 with 7 rules applied. Total rules applied 423 place count 213 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 425 place count 213 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 425 place count 213 transition count 385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 427 place count 212 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 428 place count 211 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 429 place count 211 transition count 384
Performed 66 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 561 place count 145 transition count 301
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 15 rules applied. Total rules applied 576 place count 145 transition count 286
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 580 place count 143 transition count 284
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 584 place count 139 transition count 276
Iterating global reduction 6 with 4 rules applied. Total rules applied 588 place count 139 transition count 276
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 594 place count 136 transition count 273
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 595 place count 135 transition count 271
Iterating global reduction 6 with 1 rules applied. Total rules applied 596 place count 135 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 597 place count 135 transition count 270
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 679 place count 94 transition count 316
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 699 place count 94 transition count 296
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 726 place count 67 transition count 188
Iterating global reduction 8 with 27 rules applied. Total rules applied 753 place count 67 transition count 188
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 770 place count 67 transition count 171
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 776 place count 61 transition count 139
Iterating global reduction 9 with 6 rules applied. Total rules applied 782 place count 61 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 786 place count 61 transition count 135
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 10 with 2 rules applied. Total rules applied 788 place count 60 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 10 with 16 rules applied. Total rules applied 804 place count 60 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 806 place count 58 transition count 125
Applied a total of 806 rules in 51 ms. Remains 58 /426 variables (removed 368) and now considering 125/609 (removed 484) transitions.
[2024-06-02 18:16:04] [INFO ] Flow matrix only has 102 transitions (discarded 23 similar events)
// Phase 1: matrix 102 rows 58 cols
[2024-06-02 18:16:04] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:16:04] [INFO ] Implicit Places using invariants in 39 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/426 places, 125/609 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 57/426 places, 125/609 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-15-LTLFireability-11
Product exploration explored 100000 steps with 57 reset in 69 ms.
Product exploration explored 100000 steps with 585 reset in 118 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 102 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3204 resets) in 107 ms. (370 steps per ms) remains 1/6 properties
BEST_FIRST walk for 31400 steps (218 resets) in 17 ms. (1744 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 340 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-02 18:16:05] [INFO ] Flow matrix only has 102 transitions (discarded 23 similar events)
// Phase 1: matrix 102 rows 57 cols
[2024-06-02 18:16:05] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:16:05] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 18:16:05] [INFO ] Flow matrix only has 102 transitions (discarded 23 similar events)
[2024-06-02 18:16:05] [INFO ] Invariant cache hit.
[2024-06-02 18:16:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:16:05] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-06-02 18:16:05] [INFO ] Redundant transitions in 1 ms returned []
Running 105 sub problems to find dead transitions.
[2024-06-02 18:16:05] [INFO ] Flow matrix only has 102 transitions (discarded 23 similar events)
[2024-06-02 18:16:05] [INFO ] Invariant cache hit.
[2024-06-02 18:16:05] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 101/158 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/159 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 65 constraints, problems are : Problem set: 0 solved, 105 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 101/158 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 105/169 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 1/159 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 170 constraints, problems are : Problem set: 0 solved, 105 unsolved in 1942 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 3581ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 3582ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3698 ms. Remains : 57/57 places, 125/125 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 212 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 21668 steps (1740 resets) in 57 ms. (373 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 293 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 632 reset in 78 ms.
Stack based approach found an accepted trace after 1372 steps with 106 reset with depth 19 and stack size 18 in 4 ms.
FORMULA CO4-PT-15-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-15-LTLFireability-11 finished in 5465 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((p0 U (p1||G(p0)))))))'
Support contains 4 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 412 transition count 592
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 412 transition count 592
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 412 transition count 590
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 406 transition count 584
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 406 transition count 584
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 404 transition count 582
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 404 transition count 582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 404 transition count 581
Applied a total of 47 rules in 21 ms. Remains 404 /426 variables (removed 22) and now considering 581/609 (removed 28) transitions.
// Phase 1: matrix 581 rows 404 cols
[2024-06-02 18:16:10] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 18:16:10] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 18:16:10] [INFO ] Invariant cache hit.
[2024-06-02 18:16:10] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-06-02 18:16:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 580 unsolved
[2024-06-02 18:16:20] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 581/985 variables, 404/411 constraints. Problems are: Problem set: 0 solved, 580 unsolved
[2024-06-02 18:16:28] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 5 ms to minimize.
[2024-06-02 18:16:28] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 580 unsolved
[2024-06-02 18:16:36] [INFO ] Deduced a trap composed of 151 places in 82 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 414 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 581/985 variables, 404/414 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 580/994 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 994 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 4/4 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in LTL mode, iteration 1 : 404/426 places, 581/609 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60560 ms. Remains : 404/426 places, 581/609 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-15-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CO4-PT-15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLFireability-12 finished in 60718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 410 transition count 590
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 410 transition count 590
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 410 transition count 588
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 403 transition count 581
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 403 transition count 581
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 401 transition count 579
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 401 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 401 transition count 578
Applied a total of 53 rules in 20 ms. Remains 401 /426 variables (removed 25) and now considering 578/609 (removed 31) transitions.
// Phase 1: matrix 578 rows 401 cols
[2024-06-02 18:17:10] [INFO ] Computed 6 invariants in 4 ms
[2024-06-02 18:17:10] [INFO ] Implicit Places using invariants in 94 ms returned [345]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/426 places, 578/609 transitions.
Applied a total of 0 rules in 3 ms. Remains 400 /400 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 400/426 places, 578/609 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLFireability-13
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA CO4-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLFireability-13 finished in 266 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||X(p1)))||G(p2))))'
Found a Lengthening insensitive property : CO4-PT-15-LTLFireability-05
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 426 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Graph (trivial) has 455 edges and 426 vertex of which 2 / 426 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 908 edges and 425 vertex of which 422 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.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 421 transition count 445
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 159 rules applied. Total rules applied 320 place count 265 transition count 442
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 324 place count 264 transition count 439
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 327 place count 261 transition count 439
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 327 place count 261 transition count 394
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 417 place count 216 transition count 394
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 422 place count 211 transition count 387
Iterating global reduction 4 with 5 rules applied. Total rules applied 427 place count 211 transition count 387
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 211 transition count 385
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 430 place count 210 transition count 384
Iterating global reduction 5 with 1 rules applied. Total rules applied 431 place count 210 transition count 384
Performed 66 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 563 place count 144 transition count 301
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 17 rules applied. Total rules applied 580 place count 144 transition count 284
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 584 place count 142 transition count 282
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 588 place count 138 transition count 274
Iterating global reduction 7 with 4 rules applied. Total rules applied 592 place count 138 transition count 274
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 600 place count 134 transition count 270
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 601 place count 133 transition count 268
Iterating global reduction 7 with 1 rules applied. Total rules applied 602 place count 133 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 603 place count 133 transition count 267
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 685 place count 92 transition count 316
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 706 place count 92 transition count 295
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 733 place count 65 transition count 187
Iterating global reduction 9 with 27 rules applied. Total rules applied 760 place count 65 transition count 187
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 778 place count 65 transition count 169
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 785 place count 58 transition count 131
Iterating global reduction 10 with 7 rules applied. Total rules applied 792 place count 58 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 796 place count 58 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 798 place count 56 transition count 125
Applied a total of 798 rules in 39 ms. Remains 56 /426 variables (removed 370) and now considering 125/609 (removed 484) transitions.
[2024-06-02 18:17:11] [INFO ] Flow matrix only has 107 transitions (discarded 18 similar events)
// Phase 1: matrix 107 rows 56 cols
[2024-06-02 18:17:11] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:17:11] [INFO ] Implicit Places using invariants in 138 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 55/426 places, 125/609 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 180 ms. Remains : 55/426 places, 125/609 transitions.
Running random walk in product with property : CO4-PT-15-LTLFireability-05
Product exploration explored 100000 steps with 225 reset in 47 ms.
Product exploration explored 100000 steps with 15 reset in 50 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 125 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (3078 resets) in 198 ms. (201 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40002 steps (275 resets) in 27 ms. (1428 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (273 resets) in 28 ms. (1379 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (210 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties
[2024-06-02 18:17:11] [INFO ] Flow matrix only has 107 transitions (discarded 18 similar events)
// Phase 1: matrix 107 rows 55 cols
[2024-06-02 18:17:11] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:17:11] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 67/85 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 76/161 variables, 37/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/162 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 63 constraints, problems are : Problem set: 0 solved, 2 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 67/85 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 76/161 variables, 37/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/162 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 65 constraints, problems are : Problem set: 0 solved, 2 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 161ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 518 steps, including 39 resets, run visited all 2 properties in 2 ms. (steps per millisecond=259 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1)))]
Knowledge based reduction with 31 factoid took 590 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-02 18:17:12] [INFO ] Flow matrix only has 107 transitions (discarded 18 similar events)
[2024-06-02 18:17:12] [INFO ] Invariant cache hit.
[2024-06-02 18:17:12] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 18:17:12] [INFO ] Flow matrix only has 107 transitions (discarded 18 similar events)
[2024-06-02 18:17:12] [INFO ] Invariant cache hit.
[2024-06-02 18:17:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:17:12] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-02 18:17:12] [INFO ] Flow matrix only has 107 transitions (discarded 18 similar events)
[2024-06-02 18:17:12] [INFO ] Invariant cache hit.
[2024-06-02 18:17:12] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 106/160 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 1/162 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 63 constraints, problems are : Problem set: 0 solved, 106 unsolved in 1918 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 106/160 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 65/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/161 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 41/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 1/162 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 169 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2358 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 4311ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 4312ms
Finished structural reductions in LTL mode , in 1 iterations and 4402 ms. Remains : 55/55 places, 125/125 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 123 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (3047 resets) in 266 ms. (149 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40004 steps (214 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (210 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
[2024-06-02 18:17:17] [INFO ] Flow matrix only has 107 transitions (discarded 18 similar events)
[2024-06-02 18:17:17] [INFO ] Invariant cache hit.
[2024-06-02 18:17:17] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 67/85 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 76/161 variables, 37/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/162 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 63 constraints, problems are : Problem set: 0 solved, 2 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 67/85 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 76/161 variables, 37/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/162 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 65 constraints, problems are : Problem set: 0 solved, 2 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 66 steps, including 3 resets, run visited all 2 properties in 1 ms. (steps per millisecond=66 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1)))]
Knowledge based reduction with 31 factoid took 640 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 193 reset in 62 ms.
Product exploration explored 100000 steps with 53 reset in 50 ms.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-02 18:17:18] [INFO ] Flow matrix only has 107 transitions (discarded 18 similar events)
[2024-06-02 18:17:18] [INFO ] Invariant cache hit.
[2024-06-02 18:17:18] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 18:17:18] [INFO ] Flow matrix only has 107 transitions (discarded 18 similar events)
[2024-06-02 18:17:18] [INFO ] Invariant cache hit.
[2024-06-02 18:17:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:17:18] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-02 18:17:18] [INFO ] Flow matrix only has 107 transitions (discarded 18 similar events)
[2024-06-02 18:17:18] [INFO ] Invariant cache hit.
[2024-06-02 18:17:18] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 106/160 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 1/162 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 63 constraints, problems are : Problem set: 0 solved, 106 unsolved in 1884 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 106/160 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 65/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/161 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 41/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 1/162 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 169 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2406 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 4324ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 4326ms
Finished structural reductions in LTL mode , in 1 iterations and 4422 ms. Remains : 55/55 places, 125/125 transitions.
Treatment of property CO4-PT-15-LTLFireability-05 finished in 12200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0)) U (p1&&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' '!(G(F(p0)))'
[2024-06-02 18:17:23] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:17:23] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-02 18:17:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 426 places, 609 transitions and 1617 arcs took 5 ms.
Total runtime 422187 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CO4-PT-15-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CO4-PT-15-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CO4-PT-15-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717352959999

--------------------
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-15-LTLFireability-05
ltl formula formula --ltl=/tmp/1842/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 426 places, 609 transitions and 1617 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.110 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1842/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1842/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1842/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1842/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 427 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 427, there are 670 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): ~45 levels ~10000 states ~35008 transitions
pnml2lts-mc( 1/ 4): ~67 levels ~20000 states ~61024 transitions
pnml2lts-mc( 1/ 4): ~69 levels ~40000 states ~127216 transitions
pnml2lts-mc( 1/ 4): ~72 levels ~80000 states ~288724 transitions
pnml2lts-mc( 1/ 4): ~72 levels ~160000 states ~599516 transitions
pnml2lts-mc( 1/ 4): ~530 levels ~320000 states ~1202460 transitions
pnml2lts-mc( 1/ 4): ~532 levels ~640000 states ~2552920 transitions
pnml2lts-mc( 1/ 4): ~534 levels ~1280000 states ~5674996 transitions
pnml2lts-mc( 1/ 4): ~552 levels ~2560000 states ~12662028 transitions
pnml2lts-mc( 1/ 4): ~552 levels ~5120000 states ~27721604 transitions
pnml2lts-mc( 1/ 4): ~624 levels ~10240000 states ~56820680 transitions
pnml2lts-mc( 1/ 4): ~1989 levels ~20480000 states ~112122884 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 17743362
pnml2lts-mc( 0/ 4): unique states count: 33540640
pnml2lts-mc( 0/ 4): unique transitions count: 204216565
pnml2lts-mc( 0/ 4): - self-loop count: 11258
pnml2lts-mc( 0/ 4): - claim dead count: 142624466
pnml2lts-mc( 0/ 4): - claim found count: 28017579
pnml2lts-mc( 0/ 4): - claim success count: 33540648
pnml2lts-mc( 0/ 4): - cum. max stack depth: 17098
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33540648 states 204216583 transitions, fanout: 6.089
pnml2lts-mc( 0/ 4): Total exploration time 361.890 sec (361.850 sec minimum, 361.867 sec on average)
pnml2lts-mc( 0/ 4): States per second: 92682, Transitions per second: 564306
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 268.1MB, 8.4 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/18.0%
pnml2lts-mc( 0/ 4): Stored 621 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 268.1MB (~256.0MB paged-in)
ltl formula name CO4-PT-15-LTLFireability-06
ltl formula formula --ltl=/tmp/1842/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 426 places, 609 transitions and 1617 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1842/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1842/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1842/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1842/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 428 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 427, there are 626 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: 9
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 9
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 5
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 22
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22 states 34 transitions, fanout: 1.545
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, 80.9 B/state, compr.: 4.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 621 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-15-LTLFireability-09
ltl formula formula --ltl=/tmp/1842/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 426 places, 609 transitions and 1617 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1842/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1842/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1842/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1842/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 428 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 427, there are 612 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): ~47 levels ~10000 states ~34312 transitions
pnml2lts-mc( 0/ 4): ~47 levels ~20000 states ~70072 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~40000 states ~143996 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~80000 states ~318864 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~160000 states ~659916 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~320000 states ~1449476 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~640000 states ~3132920 transitions
pnml2lts-mc( 0/ 4): ~588 levels ~1280000 states ~6234340 transitions
pnml2lts-mc( 2/ 4): ~712 levels ~2560000 states ~11369448 transitions
pnml2lts-mc( 0/ 4): ~594 levels ~5120000 states ~26059660 transitions
pnml2lts-mc( 0/ 4): ~597 levels ~10240000 states ~56405336 transitions
pnml2lts-mc( 2/ 4): ~779 levels ~20480000 states ~110800468 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12877419
pnml2lts-mc( 0/ 4): unique states count: 33552807
pnml2lts-mc( 0/ 4): unique transitions count: 197433626
pnml2lts-mc( 0/ 4): - self-loop count: 10099
pnml2lts-mc( 0/ 4): - claim dead count: 116913633
pnml2lts-mc( 0/ 4): - claim found count: 46953127
pnml2lts-mc( 0/ 4): - claim success count: 33552816
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13458
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552816 states 197433647 transitions, fanout: 5.884
pnml2lts-mc( 0/ 4): Total exploration time 353.140 sec (353.130 sec minimum, 353.138 sec on average)
pnml2lts-mc( 0/ 4): States per second: 95013, Transitions per second: 559080
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 260.1MB, 8.1 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 621 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 260.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-15"
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-15, 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-171734900900116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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