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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K 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 260K 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-16-LTLFireability-00
FORMULA_NAME CO4-PT-16-LTLFireability-01
FORMULA_NAME CO4-PT-16-LTLFireability-02
FORMULA_NAME CO4-PT-16-LTLFireability-03
FORMULA_NAME CO4-PT-16-LTLFireability-04
FORMULA_NAME CO4-PT-16-LTLFireability-05
FORMULA_NAME CO4-PT-16-LTLFireability-06
FORMULA_NAME CO4-PT-16-LTLFireability-07
FORMULA_NAME CO4-PT-16-LTLFireability-08
FORMULA_NAME CO4-PT-16-LTLFireability-09
FORMULA_NAME CO4-PT-16-LTLFireability-10
FORMULA_NAME CO4-PT-16-LTLFireability-11
FORMULA_NAME CO4-PT-16-LTLFireability-12
FORMULA_NAME CO4-PT-16-LTLFireability-13
FORMULA_NAME CO4-PT-16-LTLFireability-14
FORMULA_NAME CO4-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717351907209

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-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:11:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:11:48] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-02 18:11:48] [INFO ] Transformed 837 places.
[2024-06-02 18:11:48] [INFO ] Transformed 1122 transitions.
[2024-06-02 18:11:48] [INFO ] Found NUPN structural information;
[2024-06-02 18:11:48] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 116 places in 9 ms
Reduce places removed 116 places and 180 transitions.
FORMULA CO4-PT-16-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 721/721 places, 942/942 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 704 transition count 939
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 180 place count 544 transition count 777
Iterating global reduction 1 with 160 rules applied. Total rules applied 340 place count 544 transition count 777
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 346 place count 544 transition count 771
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 431 place count 459 transition count 669
Iterating global reduction 2 with 85 rules applied. Total rules applied 516 place count 459 transition count 669
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 519 place count 459 transition count 666
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 537 place count 441 transition count 639
Iterating global reduction 3 with 18 rules applied. Total rules applied 555 place count 441 transition count 639
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 557 place count 441 transition count 637
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 566 place count 432 transition count 628
Iterating global reduction 4 with 9 rules applied. Total rules applied 575 place count 432 transition count 628
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 581 place count 426 transition count 622
Iterating global reduction 4 with 6 rules applied. Total rules applied 587 place count 426 transition count 622
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 593 place count 426 transition count 616
Applied a total of 593 rules in 142 ms. Remains 426 /721 variables (removed 295) and now considering 616/942 (removed 326) transitions.
// Phase 1: matrix 616 rows 426 cols
[2024-06-02 18:11:48] [INFO ] Computed 7 invariants in 24 ms
[2024-06-02 18:11:49] [INFO ] Implicit Places using invariants in 299 ms returned [5, 361]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 328 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 424/721 places, 616/942 transitions.
Applied a total of 0 rules in 11 ms. Remains 424 /424 variables (removed 0) and now considering 616/616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 497 ms. Remains : 424/721 places, 616/942 transitions.
Support contains 31 out of 424 places after structural reductions.
[2024-06-02 18:11:49] [INFO ] Flatten gal took : 65 ms
[2024-06-02 18:11:49] [INFO ] Flatten gal took : 32 ms
[2024-06-02 18:11:49] [INFO ] Input system was already deterministic with 616 transitions.
RANDOM walk for 40000 steps (525 resets) in 1656 ms. (24 steps per ms) remains 14/25 properties
BEST_FIRST walk for 40004 steps (93 resets) in 269 ms. (148 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (161 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (158 resets) in 87 ms. (454 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (160 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (104 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (112 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (162 resets) in 52 ms. (754 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (155 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (156 resets) in 65 ms. (606 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (163 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (161 resets) in 49 ms. (800 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (160 resets) in 35 ms. (1111 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (155 resets) in 43 ms. (909 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (156 resets) in 42 ms. (930 steps per ms) remains 11/12 properties
// Phase 1: matrix 616 rows 424 cols
[2024-06-02 18:11:50] [INFO ] Computed 5 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 10/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 23/47 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 155/202 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 358/560 variables, 110/162 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 360/920 variables, 187/349 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/920 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 105/1025 variables, 71/420 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1025 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 11/1036 variables, 7/427 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1036 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 4/1040 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1040 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/1040 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1040/1040 variables, and 429 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1300 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 424/424 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 10/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 23/47 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 155/202 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 358/560 variables, 110/163 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 10/173 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 360/920 variables, 187/360 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/920 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 105/1025 variables, 71/431 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1025 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 11/1036 variables, 7/438 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1036 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 4/1040 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1040 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 0/1040 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1040/1040 variables, and 440 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1742 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 424/424 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 3085ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Parikh walk visited 11 properties in 1122 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 919 edges and 424 vertex of which 420 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 604
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 413 transition count 601
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 413 transition count 601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 412 transition count 600
Applied a total of 26 rules in 30 ms. Remains 412 /424 variables (removed 12) and now considering 600/616 (removed 16) transitions.
// Phase 1: matrix 600 rows 412 cols
[2024-06-02 18:11:55] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 18:11:55] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 18:11:55] [INFO ] Invariant cache hit.
[2024-06-02 18:11:55] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2024-06-02 18:11:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/1012 variables, 412/417 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:12:12] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 22 ms to minimize.
[2024-06-02 18:12:13] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1012 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 419 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:12:33] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (OVERLAPS) 600/1012 variables, 412/420 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 599/1019 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:12:47] [INFO ] Deduced a trap composed of 152 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1012 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1020 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
After SMT, in 60301ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60313ms
Starting structural reductions in LTL mode, iteration 1 : 412/424 places, 600/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60687 ms. Remains : 412/424 places, 600/616 transitions.
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-16-LTLFireability-00
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 2 ms.
FORMULA CO4-PT-16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-00 finished in 61156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 604
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 413 transition count 600
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 413 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 412 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 412 transition count 599
Applied a total of 26 rules in 25 ms. Remains 412 /424 variables (removed 12) and now considering 599/616 (removed 17) transitions.
// Phase 1: matrix 599 rows 412 cols
[2024-06-02 18:12:56] [INFO ] Computed 5 invariants in 8 ms
[2024-06-02 18:12:56] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 18:12:56] [INFO ] Invariant cache hit.
[2024-06-02 18:12:56] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2024-06-02 18:12:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (OVERLAPS) 599/1011 variables, 412/417 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 18:13:13] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:13:13] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 4 ms to minimize.
[2024-06-02 18:13:14] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1011 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1011/1011 variables, and 420 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1011 variables, 412/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1011 variables, 598/1018 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 18:13:44] [INFO ] Deduced a trap composed of 152 places in 114 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1011 variables, 1/1019 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1011/1011 variables, and 1019 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 4/4 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Starting structural reductions in LTL mode, iteration 1 : 412/424 places, 599/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60591 ms. Remains : 412/424 places, 599/616 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 895 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 13 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-16-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-16-LTLFireability-01 finished in 61246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 457 edges and 424 vertex of which 2 / 424 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 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 155 place count 418 transition count 456
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 157 rules applied. Total rules applied 312 place count 265 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 313 place count 264 transition count 452
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 313 place count 264 transition count 405
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 407 place count 217 transition count 405
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 411 place count 213 transition count 400
Iterating global reduction 3 with 4 rules applied. Total rules applied 415 place count 213 transition count 400
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 415 place count 213 transition count 397
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 421 place count 210 transition count 397
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 424 place count 207 transition count 391
Iterating global reduction 3 with 3 rules applied. Total rules applied 427 place count 207 transition count 391
Performed 61 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 549 place count 146 transition count 315
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 18 rules applied. Total rules applied 567 place count 146 transition count 297
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 573 place count 143 transition count 294
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 576 place count 140 transition count 288
Iterating global reduction 5 with 3 rules applied. Total rules applied 579 place count 140 transition count 288
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 5 with 8 rules applied. Total rules applied 587 place count 136 transition count 284
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 588 place count 135 transition count 282
Iterating global reduction 5 with 1 rules applied. Total rules applied 589 place count 135 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 590 place count 135 transition count 281
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 672 place count 94 transition count 326
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 693 place count 94 transition count 305
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 720 place count 67 transition count 197
Iterating global reduction 7 with 27 rules applied. Total rules applied 747 place count 67 transition count 197
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 765 place count 67 transition count 179
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 772 place count 60 transition count 141
Iterating global reduction 8 with 7 rules applied. Total rules applied 779 place count 60 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 784 place count 60 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 796 place count 60 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 798 place count 58 transition count 122
Applied a total of 798 rules in 144 ms. Remains 58 /424 variables (removed 366) and now considering 122/616 (removed 494) transitions.
[2024-06-02 18:13:57] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
// Phase 1: matrix 105 rows 58 cols
[2024-06-02 18:13:57] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:13:57] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 18:13:57] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
[2024-06-02 18:13:57] [INFO ] Invariant cache hit.
[2024-06-02 18:13:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:13:57] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-06-02 18:13:57] [INFO ] Redundant transitions in 3 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-02 18:13:57] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
[2024-06-02 18:13:57] [INFO ] Invariant cache hit.
[2024-06-02 18:13:57] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 104/162 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 1/163 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 65 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1425 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 104/162 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 99/163 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/163 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 164 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1983 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 3463ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 3464ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/424 places, 122/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3739 ms. Remains : 58/424 places, 122/616 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-03
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-03 finished in 3789 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))&&F((!p0 U (p1||G(!p0))))))))'
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 604
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 413 transition count 601
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 413 transition count 601
Applied a total of 24 rules in 22 ms. Remains 413 /424 variables (removed 11) and now considering 601/616 (removed 15) transitions.
// Phase 1: matrix 601 rows 413 cols
[2024-06-02 18:14:01] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 18:14:01] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:14:01] [INFO ] Invariant cache hit.
[2024-06-02 18:14:01] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-02 18:14:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 601/1014 variables, 413/418 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-02 18:14:19] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-06-02 18:14:19] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1014 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-02 18:14:28] [INFO ] Deduced a trap composed of 152 places in 81 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 421 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/421 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 600/1021 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1014 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 1021 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 3/3 constraints]
After SMT, in 60230ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Starting structural reductions in LTL mode, iteration 1 : 413/424 places, 601/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60570 ms. Remains : 413/424 places, 601/616 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-04
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-04 finished in 60778 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(p0)&&X(G(X(p1)))) U p2)))'
Support contains 6 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 607
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 605
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 412 transition count 600
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 412 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 411 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 411 transition count 599
Applied a total of 28 rules in 16 ms. Remains 411 /424 variables (removed 13) and now considering 599/616 (removed 17) transitions.
// Phase 1: matrix 599 rows 411 cols
[2024-06-02 18:15:02] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 18:15:02] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 18:15:02] [INFO ] Invariant cache hit.
[2024-06-02 18:15:02] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2024-06-02 18:15:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 18:15:12] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1010 variables, 411/417 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 18:15:20] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:15:20] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-06-02 18:15:21] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 598 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 Real declared 1010/1010 variables, and 420 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1010 variables, 411/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 598/1018 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 18:15:43] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-06-02 18:15:51] [INFO ] Deduced a trap composed of 152 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1010 variables, 2/1020 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1020 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 6/6 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Starting structural reductions in LTL mode, iteration 1 : 411/424 places, 599/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60532 ms. Remains : 411/424 places, 599/616 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CO4-PT-16-LTLFireability-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-05 finished in 60735 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((!(X(p0) U p1)&&!(p0 U p2)))))'
Support contains 2 out of 424 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 414 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 414 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 414 transition count 603
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 411 transition count 598
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 411 transition count 598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 410 transition count 597
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 410 transition count 597
Applied a total of 30 rules in 22 ms. Remains 410 /424 variables (removed 14) and now considering 597/616 (removed 19) transitions.
// Phase 1: matrix 597 rows 410 cols
[2024-06-02 18:16:02] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 18:16:02] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 18:16:02] [INFO ] Invariant cache hit.
[2024-06-02 18:16:03] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2024-06-02 18:16:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:16:20] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-06-02 18:16:21] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:16:29] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 418 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:16:40] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/419 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1007 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1015 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 4/4 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Starting structural reductions in LTL mode, iteration 1 : 410/424 places, 597/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60562 ms. Remains : 410/424 places, 597/616 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (OR p2 p1), (OR p2 p1)]
Running random walk in product with property : CO4-PT-16-LTLFireability-07
Product exploration explored 100000 steps with 321 reset in 176 ms.
Product exploration explored 100000 steps with 121 reset in 139 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 893 edges and 410 vertex of which 407 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (OR p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (OR p2 p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (894 resets) in 237 ms. (168 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (127 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
[2024-06-02 18:17:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 135/140 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/149 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 23/172 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 290/462 variables, 141/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 207/669 variables, 92/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 222/891 variables, 95/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/891 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 91/982 variables, 56/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/982 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 17/999 variables, 10/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/999 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1007 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1007 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1007 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 135/140 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/149 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/172 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 290/462 variables, 141/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 207/669 variables, 92/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/669 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 222/891 variables, 95/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/891 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 91/982 variables, 56/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/982 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 17/999 variables, 10/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/999 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/1007 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1007 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1007 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 416 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 577ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 597/597 transitions.
Graph (trivial) has 444 edges and 410 vertex of which 2 / 410 are part of one of the 1 SCC in 1 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 891 edges and 409 vertex of which 387 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 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 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 161 rules applied. Total rules applied 163 place count 387 transition count 414
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 146 rules applied. Total rules applied 309 place count 244 transition count 411
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 309 place count 244 transition count 359
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 413 place count 192 transition count 359
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 416 place count 189 transition count 356
Iterating global reduction 2 with 3 rules applied. Total rules applied 419 place count 189 transition count 356
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 422 place count 189 transition count 353
Performed 59 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 540 place count 130 transition count 281
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 17 rules applied. Total rules applied 557 place count 130 transition count 264
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 563 place count 127 transition count 261
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 567 place count 123 transition count 253
Iterating global reduction 5 with 4 rules applied. Total rules applied 571 place count 123 transition count 253
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 577 place count 120 transition count 250
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 578 place count 120 transition count 249
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 656 place count 81 transition count 290
Drop transitions (Empty/Sink Transition effects.) removed 62 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 6 with 82 rules applied. Total rules applied 738 place count 81 transition count 208
Discarding 29 places :
Symmetric choice reduction at 7 with 29 rule applications. Total rules 767 place count 52 transition count 139
Iterating global reduction 7 with 29 rules applied. Total rules applied 796 place count 52 transition count 139
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 817 place count 52 transition count 118
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 824 place count 45 transition count 89
Iterating global reduction 8 with 7 rules applied. Total rules applied 831 place count 45 transition count 89
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 836 place count 45 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 838 place count 44 transition count 99
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 841 place count 44 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 851 place count 44 transition count 86
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 852 place count 43 transition count 84
Iterating global reduction 10 with 1 rules applied. Total rules applied 853 place count 43 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 854 place count 43 transition count 83
Free-agglomeration rule applied 11 times.
Iterating global reduction 11 with 11 rules applied. Total rules applied 865 place count 43 transition count 72
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 878 place count 32 transition count 70
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 881 place count 32 transition count 70
Graph (complete) has 133 edges and 32 vertex of which 31 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 12 with 1 rules applied. Total rules applied 882 place count 31 transition count 70
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 885 place count 31 transition count 67
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 888 place count 31 transition count 67
Graph (complete) has 125 edges and 31 vertex of which 30 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 14 with 1 rules applied. Total rules applied 889 place count 30 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 892 place count 30 transition count 64
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 895 place count 30 transition count 64
Graph (complete) has 117 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 896 place count 29 transition count 64
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 899 place count 29 transition count 61
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 18 with 3 rules applied. Total rules applied 902 place count 29 transition count 61
Graph (complete) has 109 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 18 with 1 rules applied. Total rules applied 903 place count 28 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 906 place count 28 transition count 58
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 909 place count 28 transition count 58
Graph (complete) has 101 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 1 rules applied. Total rules applied 910 place count 27 transition count 58
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 21 with 3 rules applied. Total rules applied 913 place count 27 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 914 place count 26 transition count 54
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 t319.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 15 edges and 22 vertex of which 3 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
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 22 with 5 rules applied. Total rules applied 919 place count 20 transition count 50
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 19 edges and 14 vertex of which 11 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 938 place count 5 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 24 with 33 rules applied. Total rules applied 971 place count 5 transition count 5
Applied a total of 971 rules in 45 ms. Remains 5 /410 variables (removed 405) and now considering 5/597 (removed 592) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 5/410 places, 5/597 transitions.
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (OR p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-16-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-16-LTLFireability-07 finished in 62030 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||G(p1)))&&F(G(p2)))))'
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 445 edges and 424 vertex of which 2 / 424 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 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 146 place count 418 transition count 465
Reduce places removed 144 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 147 rules applied. Total rules applied 293 place count 274 transition count 462
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 301 place count 273 transition count 455
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 309 place count 266 transition count 454
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 309 place count 266 transition count 408
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 401 place count 220 transition count 408
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 405 place count 216 transition count 403
Iterating global reduction 4 with 4 rules applied. Total rules applied 409 place count 216 transition count 403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 409 place count 216 transition count 400
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 415 place count 213 transition count 400
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 418 place count 210 transition count 394
Iterating global reduction 4 with 3 rules applied. Total rules applied 421 place count 210 transition count 394
Performed 61 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 543 place count 149 transition count 319
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 560 place count 149 transition count 302
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 565 place count 147 transition count 299
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 567 place count 146 transition count 298
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 570 place count 143 transition count 292
Iterating global reduction 7 with 3 rules applied. Total rules applied 573 place count 143 transition count 292
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 579 place count 140 transition count 289
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 580 place count 139 transition count 287
Iterating global reduction 7 with 1 rules applied. Total rules applied 581 place count 139 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 582 place count 139 transition count 286
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 8 with 82 rules applied. Total rules applied 664 place count 98 transition count 332
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 683 place count 98 transition count 313
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 711 place count 70 transition count 201
Iterating global reduction 9 with 28 rules applied. Total rules applied 739 place count 70 transition count 201
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 756 place count 70 transition count 184
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 763 place count 63 transition count 146
Iterating global reduction 10 with 7 rules applied. Total rules applied 770 place count 63 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 775 place count 63 transition count 141
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 11 with 2 rules applied. Total rules applied 777 place count 62 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 796 place count 62 transition count 139
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 798 place count 62 transition count 139
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 800 place count 60 transition count 137
Applied a total of 800 rules in 56 ms. Remains 60 /424 variables (removed 364) and now considering 137/616 (removed 479) transitions.
[2024-06-02 18:17:04] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
// Phase 1: matrix 123 rows 60 cols
[2024-06-02 18:17:04] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:17:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 18:17:04] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 18:17:04] [INFO ] Invariant cache hit.
[2024-06-02 18:17:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 18:17:05] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-06-02 18:17:05] [INFO ] Redundant transitions in 4 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-02 18:17:05] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 18:17:05] [INFO ] Invariant cache hit.
[2024-06-02 18:17:05] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 122/181 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 1/183 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 70 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2341 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 122/181 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 71/139 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 1/182 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 47/187 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 188 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3107 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 5495ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 5496ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/424 places, 137/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5663 ms. Remains : 60/424 places, 137/616 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : CO4-PT-16-LTLFireability-08
Product exploration explored 100000 steps with 111 reset in 88 ms.
Product exploration explored 100000 steps with 54 reset in 79 ms.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 132 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (3018 resets) in 189 ms. (210 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (213 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
[2024-06-02 18:17:11] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 18:17:11] [INFO ] Invariant cache hit.
[2024-06-02 18:17:11] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/96 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 68/164 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/167 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/182 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/183 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/96 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/164 variables, 28/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/167 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/182 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/183 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/183 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/183 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 71 constraints, problems are : Problem set: 0 solved, 1 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 310 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 137/137 transitions.
Applied a total of 0 rules in 8 ms. Remains 60 /60 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-06-02 18:17:11] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 18:17:11] [INFO ] Invariant cache hit.
[2024-06-02 18:17:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 18:17:11] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 18:17:11] [INFO ] Invariant cache hit.
[2024-06-02 18:17:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 18:17:12] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-06-02 18:17:12] [INFO ] Redundant transitions in 3 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-02 18:17:12] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 18:17:12] [INFO ] Invariant cache hit.
[2024-06-02 18:17:12] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 122/181 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 1/183 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 70 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2411 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 122/181 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 71/139 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 1/182 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 47/187 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 188 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3235 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 5694ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 5696ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5812 ms. Remains : 60/60 places, 137/137 transitions.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 121 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (3023 resets) in 407 ms. (98 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (211 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
[2024-06-02 18:17:18] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 18:17:18] [INFO ] Invariant cache hit.
[2024-06-02 18:17:18] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/96 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 68/164 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/167 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/182 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/183 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/96 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/164 variables, 28/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/167 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/182 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/183 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/183 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/183 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 71 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 268 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 132 reset in 52 ms.
Stuttering criterion allowed to conclude after 1313 steps with 98 reset in 3 ms.
FORMULA CO4-PT-16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-08 finished in 14146 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((p0||F(p1)))))))'
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 416 transition count 607
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 416 transition count 607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 416 transition count 606
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 413 transition count 601
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 413 transition count 601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 412 transition count 600
Applied a total of 25 rules in 21 ms. Remains 412 /424 variables (removed 12) and now considering 600/616 (removed 16) transitions.
// Phase 1: matrix 600 rows 412 cols
[2024-06-02 18:17:19] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 18:17:19] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 18:17:19] [INFO ] Invariant cache hit.
[2024-06-02 18:17:19] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2024-06-02 18:17:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:17:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/418 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:17:37] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 5 ms to minimize.
[2024-06-02 18:17:38] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:17:38] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 421 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 599/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1020 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
After SMT, in 60257ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Starting structural reductions in LTL mode, iteration 1 : 412/424 places, 600/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60621 ms. Remains : 412/424 places, 600/616 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-16-LTLFireability-09
Product exploration explored 100000 steps with 729 reset in 99 ms.
Product exploration explored 100000 steps with 816 reset in 109 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 896 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (697 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (154 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (159 resets) in 39 ms. (1000 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (122 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
[2024-06-02 18:18:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 184/269 variables, 68/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/282 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 17/299 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 321/620 variables, 120/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/620 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 288/908 variables, 141/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/908 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 98/1006 variables, 68/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1006 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/1012 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1012 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1012 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 417 constraints, problems are : Problem set: 0 solved, 2 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 184/269 variables, 68/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/282 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/299 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 321/620 variables, 120/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/620 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 288/908 variables, 141/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/908 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 98/1006 variables, 68/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1006 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/1012 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1012 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1012 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 419 constraints, problems are : Problem set: 0 solved, 2 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 126 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=42 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 173 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 412 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 600/600 transitions.
Applied a total of 0 rules in 15 ms. Remains 412 /412 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-06-02 18:18:21] [INFO ] Invariant cache hit.
[2024-06-02 18:18:21] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 18:18:21] [INFO ] Invariant cache hit.
[2024-06-02 18:18:21] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2024-06-02 18:18:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:18:32] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/418 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:18:40] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:18:40] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 3 ms to minimize.
[2024-06-02 18:18:40] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 421 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 599/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1020 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Finished structural reductions in LTL mode , in 1 iterations and 60590 ms. Remains : 412/412 places, 600/600 transitions.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 896 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (666 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (132 resets) in 32 ms. (1212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (132 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (157 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 792645 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 3
Probabilistic random walk after 792645 steps, saw 124829 distinct states, run finished after 3004 ms. (steps per millisecond=263 ) properties seen :0
[2024-06-02 18:19:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 184/269 variables, 68/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13/282 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 17/299 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 321/620 variables, 120/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/620 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 288/908 variables, 141/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/908 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 98/1006 variables, 68/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1006 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/1012 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1012 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1012 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 417 constraints, problems are : Problem set: 0 solved, 3 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 184/269 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/282 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 17/299 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 321/620 variables, 120/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/620 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 288/908 variables, 141/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/908 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 98/1006 variables, 68/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1006 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 6/1012 variables, 4/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1012 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1012 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 420 constraints, problems are : Problem set: 0 solved, 3 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 795ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2247 steps, including 34 resets, run visited all 3 properties in 15 ms. (steps per millisecond=149 )
Parikh walk visited 3 properties in 14 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 198 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 630 reset in 88 ms.
Product exploration explored 100000 steps with 94 reset in 114 ms.
Support contains 2 out of 412 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 600/600 transitions.
Applied a total of 0 rules in 7 ms. Remains 412 /412 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-06-02 18:19:27] [INFO ] Invariant cache hit.
[2024-06-02 18:19:27] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 18:19:27] [INFO ] Invariant cache hit.
[2024-06-02 18:19:27] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2024-06-02 18:19:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:19:38] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/418 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:19:45] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-06-02 18:19:46] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:19:46] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 599 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 1012/1012 variables, and 421 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 599/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1020 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Finished structural reductions in LTL mode , in 1 iterations and 60523 ms. Remains : 412/412 places, 600/600 transitions.
Treatment of property CO4-PT-16-LTLFireability-09 finished in 188714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 453 edges and 424 vertex of which 2 / 424 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 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 153 place count 418 transition count 458
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 155 rules applied. Total rules applied 308 place count 267 transition count 454
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 310 place count 266 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 311 place count 265 transition count 453
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 311 place count 265 transition count 407
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 403 place count 219 transition count 407
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 407 place count 215 transition count 402
Iterating global reduction 4 with 4 rules applied. Total rules applied 411 place count 215 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 411 place count 215 transition count 399
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 417 place count 212 transition count 399
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 420 place count 209 transition count 393
Iterating global reduction 4 with 3 rules applied. Total rules applied 423 place count 209 transition count 393
Performed 62 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 547 place count 147 transition count 316
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 17 rules applied. Total rules applied 564 place count 147 transition count 299
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 570 place count 144 transition count 296
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 573 place count 141 transition count 290
Iterating global reduction 6 with 3 rules applied. Total rules applied 576 place count 141 transition count 290
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 582 place count 138 transition count 287
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 583 place count 137 transition count 285
Iterating global reduction 6 with 1 rules applied. Total rules applied 584 place count 137 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 585 place count 137 transition count 284
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 665 place count 97 transition count 327
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 685 place count 97 transition count 307
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 712 place count 70 transition count 199
Iterating global reduction 8 with 27 rules applied. Total rules applied 739 place count 70 transition count 199
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 757 place count 70 transition count 181
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 763 place count 64 transition count 149
Iterating global reduction 9 with 6 rules applied. Total rules applied 769 place count 64 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 773 place count 64 transition count 145
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 775 place count 63 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 10 with 18 rules applied. Total rules applied 793 place count 63 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 795 place count 61 transition count 142
Applied a total of 795 rules in 49 ms. Remains 61 /424 variables (removed 363) and now considering 142/616 (removed 474) transitions.
[2024-06-02 18:20:27] [INFO ] Flow matrix only has 119 transitions (discarded 23 similar events)
// Phase 1: matrix 119 rows 61 cols
[2024-06-02 18:20:27] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:20:27] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 18:20:27] [INFO ] Flow matrix only has 119 transitions (discarded 23 similar events)
[2024-06-02 18:20:27] [INFO ] Invariant cache hit.
[2024-06-02 18:20:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 18:20:27] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-02 18:20:27] [INFO ] Redundant transitions in 3 ms returned []
Running 119 sub problems to find dead transitions.
[2024-06-02 18:20:27] [INFO ] Flow matrix only has 119 transitions (discarded 23 similar events)
[2024-06-02 18:20:27] [INFO ] Invariant cache hit.
[2024-06-02 18:20:27] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 118/179 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 70 constraints, problems are : Problem set: 0 solved, 119 unsolved in 1766 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 118/179 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 119/188 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 1/180 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/180 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 189 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2456 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 4274ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 4275ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/424 places, 142/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4514 ms. Remains : 61/424 places, 142/616 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-10
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-10 finished in 4601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1||X(F(p2)))))))'
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 452 edges and 424 vertex of which 2 / 424 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 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 151 place count 418 transition count 460
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 153 rules applied. Total rules applied 304 place count 269 transition count 456
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 306 place count 268 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 307 place count 267 transition count 455
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 307 place count 267 transition count 408
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 401 place count 220 transition count 408
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 406 place count 215 transition count 402
Iterating global reduction 4 with 5 rules applied. Total rules applied 411 place count 215 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 411 place count 215 transition count 399
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 417 place count 212 transition count 399
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 419 place count 210 transition count 395
Iterating global reduction 4 with 2 rules applied. Total rules applied 421 place count 210 transition count 395
Performed 61 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 543 place count 149 transition count 319
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 17 rules applied. Total rules applied 560 place count 149 transition count 302
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 566 place count 146 transition count 299
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 569 place count 143 transition count 293
Iterating global reduction 6 with 3 rules applied. Total rules applied 572 place count 143 transition count 293
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 578 place count 140 transition count 290
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 660 place count 99 transition count 340
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 681 place count 99 transition count 319
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 709 place count 71 transition count 207
Iterating global reduction 7 with 28 rules applied. Total rules applied 737 place count 71 transition count 207
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 756 place count 71 transition count 188
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 762 place count 65 transition count 156
Iterating global reduction 8 with 6 rules applied. Total rules applied 768 place count 65 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 772 place count 65 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 786 place count 65 transition count 138
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 788 place count 63 transition count 136
Applied a total of 788 rules in 48 ms. Remains 63 /424 variables (removed 361) and now considering 136/616 (removed 480) transitions.
[2024-06-02 18:20:32] [INFO ] Flow matrix only has 118 transitions (discarded 18 similar events)
// Phase 1: matrix 118 rows 63 cols
[2024-06-02 18:20:32] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:20:32] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 18:20:32] [INFO ] Flow matrix only has 118 transitions (discarded 18 similar events)
[2024-06-02 18:20:32] [INFO ] Invariant cache hit.
[2024-06-02 18:20:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:20:32] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-06-02 18:20:32] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
[2024-06-02 18:20:32] [INFO ] Flow matrix only has 118 transitions (discarded 18 similar events)
[2024-06-02 18:20:32] [INFO ] Invariant cache hit.
[2024-06-02 18:20:32] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 117/179 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/181 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 70 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2371 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 117/179 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 68/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/180 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/181 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 183 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2928 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 5340ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 5341ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/424 places, 136/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5498 ms. Remains : 63/424 places, 136/616 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-16-LTLFireability-11
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-11 finished in 5614 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)))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 414 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 414 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 414 transition count 603
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 411 transition count 598
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 411 transition count 598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 410 transition count 597
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 410 transition count 597
Applied a total of 30 rules in 26 ms. Remains 410 /424 variables (removed 14) and now considering 597/616 (removed 19) transitions.
// Phase 1: matrix 597 rows 410 cols
[2024-06-02 18:20:37] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 18:20:38] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:20:38] [INFO ] Invariant cache hit.
[2024-06-02 18:20:38] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2024-06-02 18:20:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:20:55] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 3 ms to minimize.
[2024-06-02 18:20:55] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:21:03] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 418 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:21:15] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/419 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1007 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1015 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 4/4 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Starting structural reductions in LTL mode, iteration 1 : 410/424 places, 597/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60619 ms. Remains : 410/424 places, 597/616 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-12 finished in 60710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 414 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 414 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 414 transition count 603
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 411 transition count 598
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 411 transition count 598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 410 transition count 597
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 410 transition count 597
Applied a total of 30 rules in 18 ms. Remains 410 /424 variables (removed 14) and now considering 597/616 (removed 19) transitions.
[2024-06-02 18:21:38] [INFO ] Invariant cache hit.
[2024-06-02 18:21:38] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 18:21:38] [INFO ] Invariant cache hit.
[2024-06-02 18:21:38] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2024-06-02 18:21:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:21:56] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 3 ms to minimize.
[2024-06-02 18:21:56] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:22:04] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 3 ms to minimize.
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 1007/1007 variables, and 418 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:22:16] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/419 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1007 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1015 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 4/4 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Starting structural reductions in LTL mode, iteration 1 : 410/424 places, 597/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60524 ms. Remains : 410/424 places, 597/616 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-13
Entered a terminal (fully accepting) state of product in 131 steps with 2 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-13 finished in 60697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 457 edges and 424 vertex of which 2 / 424 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 918 edges and 423 vertex of which 422 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 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 154 rules applied. Total rules applied 156 place count 421 transition count 459
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 158 rules applied. Total rules applied 314 place count 267 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 315 place count 266 transition count 455
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 315 place count 266 transition count 408
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 409 place count 219 transition count 408
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 413 place count 215 transition count 403
Iterating global reduction 3 with 4 rules applied. Total rules applied 417 place count 215 transition count 403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 417 place count 215 transition count 400
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 423 place count 212 transition count 400
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 426 place count 209 transition count 394
Iterating global reduction 3 with 3 rules applied. Total rules applied 429 place count 209 transition count 394
Performed 62 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 553 place count 147 transition count 317
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 18 rules applied. Total rules applied 571 place count 147 transition count 299
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 577 place count 144 transition count 296
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 580 place count 141 transition count 290
Iterating global reduction 5 with 3 rules applied. Total rules applied 583 place count 141 transition count 290
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 5 with 8 rules applied. Total rules applied 591 place count 137 transition count 286
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 592 place count 136 transition count 284
Iterating global reduction 5 with 1 rules applied. Total rules applied 593 place count 136 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 594 place count 136 transition count 283
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 6 with 82 rules applied. Total rules applied 676 place count 95 transition count 329
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 696 place count 95 transition count 309
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 724 place count 67 transition count 197
Iterating global reduction 7 with 28 rules applied. Total rules applied 752 place count 67 transition count 197
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 771 place count 67 transition count 178
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 778 place count 60 transition count 140
Iterating global reduction 8 with 7 rules applied. Total rules applied 785 place count 60 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 790 place count 60 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 792 place count 59 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 812 place count 59 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 814 place count 57 transition count 130
Applied a total of 814 rules in 43 ms. Remains 57 /424 variables (removed 367) and now considering 130/616 (removed 486) transitions.
[2024-06-02 18:22:39] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
// Phase 1: matrix 102 rows 57 cols
[2024-06-02 18:22:39] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:22:39] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-02 18:22:39] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
[2024-06-02 18:22:39] [INFO ] Invariant cache hit.
[2024-06-02 18:22:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:22:39] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-06-02 18:22:39] [INFO ] Redundant transitions in 1 ms returned []
Running 107 sub problems to find dead transitions.
[2024-06-02 18:22:39] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
[2024-06-02 18:22:39] [INFO ] Invariant cache hit.
[2024-06-02 18:22:39] [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, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 101/158 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 1/159 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 65 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1481 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 101/158 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 107/171 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 1/159 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 172 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1988 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 3509ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 3510ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/424 places, 130/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3743 ms. Remains : 57/424 places, 130/616 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-14
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-14 finished in 3796 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((p0||F(p1)))))))'
Found a Lengthening insensitive property : CO4-PT-16-LTLFireability-09
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 455 edges and 424 vertex of which 2 / 424 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 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 154 place count 418 transition count 457
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 154 rules applied. Total rules applied 308 place count 266 transition count 455
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 308 place count 266 transition count 408
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 402 place count 219 transition count 408
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 405 place count 216 transition count 404
Iterating global reduction 2 with 3 rules applied. Total rules applied 408 place count 216 transition count 404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 408 place count 216 transition count 402
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 412 place count 214 transition count 402
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 414 place count 212 transition count 398
Iterating global reduction 2 with 2 rules applied. Total rules applied 416 place count 212 transition count 398
Performed 63 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 542 place count 149 transition count 320
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 18 rules applied. Total rules applied 560 place count 149 transition count 302
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 566 place count 146 transition count 299
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 569 place count 143 transition count 293
Iterating global reduction 4 with 3 rules applied. Total rules applied 572 place count 143 transition count 293
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 580 place count 139 transition count 289
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 581 place count 138 transition count 287
Iterating global reduction 4 with 1 rules applied. Total rules applied 582 place count 138 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 583 place count 138 transition count 286
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 665 place count 97 transition count 334
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 686 place count 97 transition count 313
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 714 place count 69 transition count 201
Iterating global reduction 6 with 28 rules applied. Total rules applied 742 place count 69 transition count 201
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 761 place count 69 transition count 182
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 767 place count 63 transition count 150
Iterating global reduction 7 with 6 rules applied. Total rules applied 773 place count 63 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 777 place count 63 transition count 146
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 779 place count 61 transition count 144
Applied a total of 779 rules in 44 ms. Remains 61 /424 variables (removed 363) and now considering 144/616 (removed 472) transitions.
[2024-06-02 18:22:43] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
// Phase 1: matrix 126 rows 61 cols
[2024-06-02 18:22:43] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:22:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 18:22:43] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 18:22:43] [INFO ] Invariant cache hit.
[2024-06-02 18:22:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:22:43] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-06-02 18:22:43] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 18:22:43] [INFO ] Invariant cache hit.
[2024-06-02 18:22:43] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 125/186 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 68 constraints, problems are : Problem set: 0 solved, 118 unsolved in 1749 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 125/186 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 118/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 1/187 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 186 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2358 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 4143ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 4144ms
Starting structural reductions in LI_LTL mode, iteration 1 : 61/424 places, 144/616 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4465 ms. Remains : 61/424 places, 144/616 transitions.
Running random walk in product with property : CO4-PT-16-LTLFireability-09
Product exploration explored 100000 steps with 2097 reset in 103 ms.
Product exploration explored 100000 steps with 1811 reset in 58 ms.
Computed a total of 9 stabilizing places and 28 stable transitions
Computed a total of 9 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 83 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3314 resets) in 154 ms. (258 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (257 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-06-02 18:22:48] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 18:22:48] [INFO ] Invariant cache hit.
[2024-06-02 18:22:48] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/63 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/96 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/99 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/110 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/149 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 37/186 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/187 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/63 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/96 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/99 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/110 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/149 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 37/186 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/187 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/187 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 25 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 149 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-06-02 18:22:48] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 18:22:48] [INFO ] Invariant cache hit.
[2024-06-02 18:22:48] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 18:22:48] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 18:22:48] [INFO ] Invariant cache hit.
[2024-06-02 18:22:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:22:49] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-06-02 18:22:49] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 18:22:49] [INFO ] Invariant cache hit.
[2024-06-02 18:22:49] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 125/186 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 68 constraints, problems are : Problem set: 0 solved, 118 unsolved in 1771 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 125/186 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 118/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 1/187 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 186 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2262 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 4070ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 4071ms
Finished structural reductions in LTL mode , in 1 iterations and 4170 ms. Remains : 61/61 places, 144/144 transitions.
Computed a total of 9 stabilizing places and 28 stable transitions
Computed a total of 9 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 94 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3342 resets) in 125 ms. (317 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (254 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
[2024-06-02 18:22:53] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 18:22:53] [INFO ] Invariant cache hit.
[2024-06-02 18:22:53] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/63 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/96 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/99 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/110 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/149 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 37/186 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/187 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/63 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/96 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/99 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/110 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/149 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 37/186 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/187 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/187 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 169 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 77 reset in 33 ms.
Product exploration explored 100000 steps with 223 reset in 42 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-06-02 18:22:54] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 18:22:54] [INFO ] Invariant cache hit.
[2024-06-02 18:22:54] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 18:22:54] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 18:22:54] [INFO ] Invariant cache hit.
[2024-06-02 18:22:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:22:54] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-06-02 18:22:54] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 18:22:54] [INFO ] Invariant cache hit.
[2024-06-02 18:22:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 125/186 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 68 constraints, problems are : Problem set: 0 solved, 118 unsolved in 1822 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 125/186 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 118/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 1/187 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 186 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2455 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 4316ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 4317ms
Finished structural reductions in LTL mode , in 1 iterations and 4413 ms. Remains : 61/61 places, 144/144 transitions.
Treatment of property CO4-PT-16-LTLFireability-09 finished in 15517 ms.
[2024-06-02 18:22:58] [INFO ] Flatten gal took : 28 ms
[2024-06-02 18:22:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-02 18:22:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 424 places, 616 transitions and 1650 arcs took 7 ms.
Total runtime 670415 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CO4-PT-16-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717352841520

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name CO4-PT-16-LTLFireability-09
ltl formula formula --ltl=/tmp/1634/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 424 places, 616 transitions and 1650 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.120 real 0.010 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1634/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1634/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1634/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1634/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 425 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 425, there are 633 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~59 levels ~10000 states ~30236 transitions
pnml2lts-mc( 1/ 4): ~73 levels ~20000 states ~63516 transitions
pnml2lts-mc( 1/ 4): ~73 levels ~40000 states ~127424 transitions
pnml2lts-mc( 2/ 4): ~158 levels ~80000 states ~285160 transitions
pnml2lts-mc( 2/ 4): ~158 levels ~160000 states ~615436 transitions
pnml2lts-mc( 1/ 4): ~92 levels ~320000 states ~1420916 transitions
pnml2lts-mc( 1/ 4): ~337 levels ~640000 states ~2775232 transitions
pnml2lts-mc( 1/ 4): ~635 levels ~1280000 states ~6099668 transitions
pnml2lts-mc( 2/ 4): ~190 levels ~2560000 states ~12938324 transitions
pnml2lts-mc( 2/ 4): ~193 levels ~5120000 states ~25634816 transitions
pnml2lts-mc( 0/ 4): ~2289 levels ~10240000 states ~47442072 transitions
pnml2lts-mc( 0/ 4): ~2311 levels ~20480000 states ~95100648 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~6777!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9131566
pnml2lts-mc( 0/ 4): unique states count: 24370764
pnml2lts-mc( 0/ 4): unique transitions count: 125823099
pnml2lts-mc( 0/ 4): - self-loop count: 30987
pnml2lts-mc( 0/ 4): - claim dead count: 66310489
pnml2lts-mc( 0/ 4): - claim found count: 35065828
pnml2lts-mc( 0/ 4): - claim success count: 24370772
pnml2lts-mc( 0/ 4): - cum. max stack depth: 64310
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 24370772 states 125823118 transitions, fanout: 5.163
pnml2lts-mc( 0/ 4): Total exploration time 262.060 sec (262.040 sec minimum, 262.052 sec on average)
pnml2lts-mc( 0/ 4): States per second: 92997, Transitions per second: 480131
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 194.7MB, 8.4 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 72.0%/13.0%
pnml2lts-mc( 0/ 4): Stored 628 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 194.7MB (~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-16"
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-16, 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-171734901000124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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