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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K 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 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K 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 336K 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-20-LTLFireability-00
FORMULA_NAME CO4-PT-20-LTLFireability-01
FORMULA_NAME CO4-PT-20-LTLFireability-02
FORMULA_NAME CO4-PT-20-LTLFireability-03
FORMULA_NAME CO4-PT-20-LTLFireability-04
FORMULA_NAME CO4-PT-20-LTLFireability-05
FORMULA_NAME CO4-PT-20-LTLFireability-06
FORMULA_NAME CO4-PT-20-LTLFireability-07
FORMULA_NAME CO4-PT-20-LTLFireability-08
FORMULA_NAME CO4-PT-20-LTLFireability-09
FORMULA_NAME CO4-PT-20-LTLFireability-10
FORMULA_NAME CO4-PT-20-LTLFireability-11
FORMULA_NAME CO4-PT-20-LTLFireability-12
FORMULA_NAME CO4-PT-20-LTLFireability-13
FORMULA_NAME CO4-PT-20-LTLFireability-14
FORMULA_NAME CO4-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717352966080

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-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:29:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:29:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:29:27] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-06-02 18:29:27] [INFO ] Transformed 1178 places.
[2024-06-02 18:29:27] [INFO ] Transformed 1463 transitions.
[2024-06-02 18:29:27] [INFO ] Found NUPN structural information;
[2024-06-02 18:29:27] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 187 places in 15 ms
Reduce places removed 187 places and 251 transitions.
FORMULA CO4-PT-20-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 991 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 969 transition count 1207
Discarding 168 places :
Symmetric choice reduction at 1 with 168 rule applications. Total rules 195 place count 801 transition count 1037
Iterating global reduction 1 with 168 rules applied. Total rules applied 363 place count 801 transition count 1037
Discarding 142 places :
Symmetric choice reduction at 1 with 142 rule applications. Total rules 505 place count 659 transition count 882
Iterating global reduction 1 with 142 rules applied. Total rules applied 647 place count 659 transition count 882
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 656 place count 659 transition count 873
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 725 place count 590 transition count 800
Iterating global reduction 2 with 69 rules applied. Total rules applied 794 place count 590 transition count 800
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 797 place count 590 transition count 797
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 844 place count 543 transition count 750
Iterating global reduction 3 with 47 rules applied. Total rules applied 891 place count 543 transition count 750
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 900 place count 543 transition count 741
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 919 place count 524 transition count 722
Iterating global reduction 4 with 19 rules applied. Total rules applied 938 place count 524 transition count 722
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 940 place count 524 transition count 720
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 945 place count 519 transition count 715
Iterating global reduction 5 with 5 rules applied. Total rules applied 950 place count 519 transition count 715
Applied a total of 950 rules in 250 ms. Remains 519 /991 variables (removed 472) and now considering 715/1212 (removed 497) transitions.
// Phase 1: matrix 715 rows 519 cols
[2024-06-02 18:29:27] [INFO ] Computed 7 invariants in 31 ms
[2024-06-02 18:29:28] [INFO ] Implicit Places using invariants in 296 ms returned [6, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 326 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 517/991 places, 715/1212 transitions.
Applied a total of 0 rules in 16 ms. Remains 517 /517 variables (removed 0) and now considering 715/715 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 606 ms. Remains : 517/991 places, 715/1212 transitions.
Support contains 30 out of 517 places after structural reductions.
[2024-06-02 18:29:28] [INFO ] Flatten gal took : 92 ms
[2024-06-02 18:29:28] [INFO ] Flatten gal took : 66 ms
[2024-06-02 18:29:28] [INFO ] Input system was already deterministic with 715 transitions.
Support contains 29 out of 517 places (down from 30) after GAL structural reductions.
RANDOM walk for 40000 steps (663 resets) in 2072 ms. (19 steps per ms) remains 12/24 properties
BEST_FIRST walk for 40004 steps (142 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (143 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (141 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (142 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (101 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (141 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (108 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (125 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (140 resets) in 42 ms. (930 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (118 resets) in 85 ms. (465 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (136 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
// Phase 1: matrix 715 rows 517 cols
[2024-06-02 18:29:29] [INFO ] Computed 5 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 21/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 19/55 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 161/216 variables, 55/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 345/561 variables, 115/175 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 390/951 variables, 183/358 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/951 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 207/1158 variables, 117/475 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1158 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 53/1211 variables, 34/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1211 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 17/1228 variables, 10/519 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1228 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 4/1232 variables, 3/522 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1232 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 0/1232 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 522 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1457 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 517/517 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 21/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 19/55 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 161/216 variables, 55/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 345/561 variables, 115/175 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 10/185 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 390/951 variables, 183/368 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/951 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 207/1158 variables, 117/485 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1158 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 53/1211 variables, 34/519 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1211 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 17/1228 variables, 10/529 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1228 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 4/1232 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1232 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 0/1232 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1232/1232 variables, and 532 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2197 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 517/517 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 3712ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 85 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=85 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 232 ms.
FORMULA CO4-PT-20-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CO4-PT-20-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CO4-PT-20-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 23 stabilizing places and 38 stable transitions
Graph (complete) has 1041 edges and 517 vertex of which 510 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.11 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))&&(p1 U (p2||G(p1)))))'
Support contains 4 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Graph (trivial) has 548 edges and 517 vertex of which 3 / 517 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1039 edges and 515 vertex of which 508 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 214 rules applied. Total rules applied 216 place count 507 transition count 490
Reduce places removed 214 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 218 rules applied. Total rules applied 434 place count 293 transition count 486
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 436 place count 291 transition count 486
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 436 place count 291 transition count 438
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 532 place count 243 transition count 438
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 536 place count 239 transition count 434
Iterating global reduction 3 with 4 rules applied. Total rules applied 540 place count 239 transition count 434
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 540 place count 239 transition count 432
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 544 place count 237 transition count 432
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 547 place count 234 transition count 427
Iterating global reduction 3 with 3 rules applied. Total rules applied 550 place count 234 transition count 427
Performed 84 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 718 place count 150 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 728 place count 150 transition count 307
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 736 place count 142 transition count 294
Iterating global reduction 4 with 8 rules applied. Total rules applied 744 place count 142 transition count 294
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 4 with 82 rules applied. Total rules applied 826 place count 101 transition count 339
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 846 place count 101 transition count 319
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 873 place count 74 transition count 211
Iterating global reduction 5 with 27 rules applied. Total rules applied 900 place count 74 transition count 211
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 918 place count 74 transition count 193
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 925 place count 67 transition count 155
Iterating global reduction 6 with 7 rules applied. Total rules applied 932 place count 67 transition count 155
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 937 place count 67 transition count 150
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 943 place count 64 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 7 with 45 rules applied. Total rules applied 988 place count 64 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 990 place count 62 transition count 133
Applied a total of 990 rules in 119 ms. Remains 62 /517 variables (removed 455) and now considering 133/715 (removed 582) transitions.
[2024-06-02 18:29:34] [INFO ] Flow matrix only has 113 transitions (discarded 20 similar events)
// Phase 1: matrix 113 rows 62 cols
[2024-06-02 18:29:34] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:29:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 18:29:34] [INFO ] Flow matrix only has 113 transitions (discarded 20 similar events)
[2024-06-02 18:29:34] [INFO ] Invariant cache hit.
[2024-06-02 18:29:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:29:34] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-06-02 18:29:34] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2024-06-02 18:29:34] [INFO ] Flow matrix only has 113 transitions (discarded 20 similar events)
[2024-06-02 18:29:34] [INFO ] Invariant cache hit.
[2024-06-02 18:29:34] [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, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 112/174 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 1/175 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/175 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 69 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1673 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 62/62 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 112/174 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 110/178 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/175 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 179 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2180 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 62/62 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 3915ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3917ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/517 places, 133/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4153 ms. Remains : 62/517 places, 133/715 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CO4-PT-20-LTLFireability-00
Product exploration explored 100000 steps with 466 reset in 181 ms.
Product exploration explored 100000 steps with 259 reset in 97 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 p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 110 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 310 steps (21 resets) in 11 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 11 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 3 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 133/133 transitions.
Applied a total of 0 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-06-02 18:29:39] [INFO ] Flow matrix only has 113 transitions (discarded 20 similar events)
[2024-06-02 18:29:39] [INFO ] Invariant cache hit.
[2024-06-02 18:29:39] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:29:39] [INFO ] Flow matrix only has 113 transitions (discarded 20 similar events)
[2024-06-02 18:29:39] [INFO ] Invariant cache hit.
[2024-06-02 18:29:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:29:39] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-06-02 18:29:39] [INFO ] Redundant transitions in 4 ms returned []
Running 110 sub problems to find dead transitions.
[2024-06-02 18:29:39] [INFO ] Flow matrix only has 113 transitions (discarded 20 similar events)
[2024-06-02 18:29:39] [INFO ] Invariant cache hit.
[2024-06-02 18:29:39] [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, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 112/174 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 1/175 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/175 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 69 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1839 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 62/62 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 112/174 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 110/178 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/175 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 179 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2227 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 62/62 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 4139ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 4141ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4298 ms. Remains : 62/62 places, 133/133 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 1138 steps (89 resets) in 8 ms. (126 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 17 reset in 57 ms.
Product exploration explored 100000 steps with 232 reset in 157 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 133/133 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 61 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 60 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 60 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 59 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 59 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9 place count 59 transition count 126
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 4 with 2 rules applied. Total rules applied 11 place count 58 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 18 place count 58 transition count 136
Applied a total of 18 rules in 24 ms. Remains 58 /62 variables (removed 4) and now considering 136/133 (removed -3) transitions.
[2024-06-02 18:29:44] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
// Phase 1: matrix 107 rows 58 cols
[2024-06-02 18:29:44] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:29:44] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 18:29:44] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
[2024-06-02 18:29:44] [INFO ] Invariant cache hit.
[2024-06-02 18:29:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:29:44] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-06-02 18:29:44] [INFO ] Redundant transitions in 2 ms returned []
Running 113 sub problems to find dead transitions.
[2024-06-02 18:29:44] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
[2024-06-02 18:29:44] [INFO ] Invariant cache hit.
[2024-06-02 18:29:44] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 106/164 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 1/165 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 66 constraints, problems are : Problem set: 0 solved, 113 unsolved in 1566 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 3/3 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/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 106/164 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 113/178 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/165 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/165 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 179 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2260 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 3866ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 3868ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/62 places, 136/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4002 ms. Remains : 58/62 places, 136/133 transitions.
Treatment of property CO4-PT-20-LTLFireability-00 finished in 14187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&F((p1 U (G(p1)||(p1&&G(!p2)))))))'
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 705
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 705
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 500 transition count 697
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 500 transition count 697
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 498 transition count 695
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 498 transition count 695
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 497 transition count 694
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 497 transition count 694
Applied a total of 40 rules in 35 ms. Remains 497 /517 variables (removed 20) and now considering 694/715 (removed 21) transitions.
// Phase 1: matrix 694 rows 497 cols
[2024-06-02 18:29:48] [INFO ] Computed 5 invariants in 8 ms
[2024-06-02 18:29:48] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 18:29:48] [INFO ] Invariant cache hit.
[2024-06-02 18:29:48] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 693 sub problems to find dead transitions.
[2024-06-02 18:29:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 693 unsolved
[2024-06-02 18:30:02] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 6 ms to minimize.
[2024-06-02 18:30:02] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 694/1191 variables, 497/504 constraints. Problems are: Problem set: 0 solved, 693 unsolved
[2024-06-02 18:30:14] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-06-02 18:30:14] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-06-02 18:30:14] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 4 ms to minimize.
[2024-06-02 18:30:15] [INFO ] Deduced a trap composed of 191 places in 102 ms of which 2 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 1191/1191 variables, and 508 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 694/1191 variables, 497/508 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1191 variables, 693/1201 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1191/1191 variables, and 1201 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 6/6 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 693 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Starting structural reductions in LTL mode, iteration 1 : 497/517 places, 694/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60707 ms. Remains : 497/517 places, 694/715 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p2 (NOT p1)), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-01
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 2 ms.
FORMULA CO4-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-01 finished in 60926 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)||(X(F(p0))&&p1))))'
Support contains 4 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 705
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 705
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 499 transition count 696
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 499 transition count 696
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 496 transition count 692
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 496 transition count 692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 691
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 691
Applied a total of 44 rules in 32 ms. Remains 495 /517 variables (removed 22) and now considering 691/715 (removed 24) transitions.
// Phase 1: matrix 691 rows 495 cols
[2024-06-02 18:30:49] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:30:49] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 18:30:49] [INFO ] Invariant cache hit.
[2024-06-02 18:30:49] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2024-06-02 18:30:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-02 18:31:03] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:31:03] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (OVERLAPS) 691/1186 variables, 495/502 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-02 18:31:15] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 3 ms to minimize.
[2024-06-02 18:31:15] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 3 ms to minimize.
[2024-06-02 18:31:15] [INFO ] Deduced a trap composed of 187 places in 88 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 505 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (OVERLAPS) 691/1186 variables, 495/505 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1186 variables, 690/1195 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1195 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 5/5 constraints]
After SMT, in 60323ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60329ms
Starting structural reductions in LTL mode, iteration 1 : 495/517 places, 691/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60728 ms. Remains : 495/517 places, 691/715 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-02
Product exploration explored 100000 steps with 1244 reset in 107 ms.
Product exploration explored 100000 steps with 966 reset in 128 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1003 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 82 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (470 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (139 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1309632 steps, run timeout after 3001 ms. (steps per millisecond=436 ) properties seen :0 out of 1
Probabilistic random walk after 1309632 steps, saw 248678 distinct states, run finished after 3004 ms. (steps per millisecond=435 ) properties seen :0
[2024-06-02 18:31:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/82 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 154/236 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/248 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/275 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 333/608 variables, 125/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/608 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 307/915 variables, 144/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/915 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 204/1119 variables, 110/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1119 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 55/1174 variables, 36/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1174 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 10/1184 variables, 6/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1184 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/1186 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1186 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1186 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/82 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 154/236 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/248 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 27/275 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 333/608 variables, 125/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/608 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 307/915 variables, 144/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/915 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 204/1119 variables, 110/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1119 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 55/1174 variables, 36/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1174 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 10/1184 variables, 6/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1184 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/1186 variables, 2/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1186 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1186 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 658ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 691/691 transitions.
Graph (trivial) has 534 edges and 495 vertex of which 3 / 495 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1000 edges and 493 vertex of which 476 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 237 rules applied. Total rules applied 239 place count 476 transition count 437
Reduce places removed 212 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 214 rules applied. Total rules applied 453 place count 264 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 454 place count 263 transition count 435
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 454 place count 263 transition count 386
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 552 place count 214 transition count 386
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 555 place count 211 transition count 383
Iterating global reduction 3 with 3 rules applied. Total rules applied 558 place count 211 transition count 383
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 561 place count 211 transition count 380
Performed 78 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 717 place count 133 transition count 279
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 728 place count 133 transition count 268
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 736 place count 125 transition count 255
Iterating global reduction 5 with 8 rules applied. Total rules applied 744 place count 125 transition count 255
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 752 place count 121 transition count 251
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 753 place count 120 transition count 249
Iterating global reduction 5 with 1 rules applied. Total rules applied 754 place count 120 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 755 place count 120 transition count 248
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 833 place count 81 transition count 289
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 915 place count 81 transition count 207
Discarding 29 places :
Symmetric choice reduction at 7 with 29 rule applications. Total rules 944 place count 52 transition count 138
Iterating global reduction 7 with 29 rules applied. Total rules applied 973 place count 52 transition count 138
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 994 place count 52 transition count 117
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1001 place count 45 transition count 88
Iterating global reduction 8 with 7 rules applied. Total rules applied 1008 place count 45 transition count 88
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1013 place count 45 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 1015 place count 44 transition count 90
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1017 place count 44 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 1024 place count 44 transition count 81
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1025 place count 43 transition count 79
Iterating global reduction 10 with 1 rules applied. Total rules applied 1026 place count 43 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1027 place count 43 transition count 78
Free-agglomeration rule applied 11 times.
Iterating global reduction 11 with 11 rules applied. Total rules applied 1038 place count 43 transition count 67
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 1051 place count 32 transition count 65
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 1054 place count 32 transition count 65
Graph (complete) has 127 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 1055 place count 31 transition count 65
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 1058 place count 31 transition count 62
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 1061 place count 31 transition count 62
Graph (complete) has 119 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 1062 place count 30 transition count 62
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 1065 place count 30 transition count 59
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 1068 place count 30 transition count 59
Graph (complete) has 111 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 1069 place count 29 transition count 59
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 1072 place count 29 transition count 56
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 1075 place count 29 transition count 56
Graph (complete) has 103 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 18 with 1 rules applied. Total rules applied 1076 place count 28 transition count 56
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 1079 place count 28 transition count 53
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 1082 place count 28 transition count 53
Graph (complete) has 95 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 1083 place count 27 transition count 53
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 1086 place count 27 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 1087 place count 26 transition count 49
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 t376.t380.t568.t600 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 1092 place count 20 transition count 45
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 20 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 18 rules applied. Total rules applied 1110 place count 5 transition count 34
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 24 with 31 rules applied. Total rules applied 1141 place count 4 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 25 with 1 Pre rules applied. Total rules applied 1141 place count 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 1143 place count 3 transition count 3
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 25 with 1 rules applied. Total rules applied 1144 place count 3 transition count 3
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 1145 place count 2 transition count 2
Iterating global reduction 25 with 1 rules applied. Total rules applied 1146 place count 2 transition count 2
Applied a total of 1146 rules in 63 ms. Remains 2 /495 variables (removed 493) and now considering 2/691 (removed 689) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 2/495 places, 2/691 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-20-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-20-LTLFireability-02 finished in 65194 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 U (p1||G(p0)))||(p2&&X(p3))))))'
Support contains 3 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 705
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 705
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 499 transition count 696
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 499 transition count 696
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 496 transition count 692
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 496 transition count 692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 691
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 691
Applied a total of 44 rules in 32 ms. Remains 495 /517 variables (removed 22) and now considering 691/715 (removed 24) transitions.
// Phase 1: matrix 691 rows 495 cols
[2024-06-02 18:31:54] [INFO ] Computed 5 invariants in 11 ms
[2024-06-02 18:31:54] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 18:31:54] [INFO ] Invariant cache hit.
[2024-06-02 18:31:54] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2024-06-02 18:31:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-02 18:32:19] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2024-06-02 18:32:20] [INFO ] Deduced a trap composed of 187 places in 73 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 502 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-02 18:32:34] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:32:34] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 5 (OVERLAPS) 691/1186 variables, 495/504 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1186 variables, 690/1194 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1194 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 4/4 constraints]
After SMT, in 60280ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Starting structural reductions in LTL mode, iteration 1 : 495/517 places, 691/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60682 ms. Remains : 495/517 places, 691/715 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : CO4-PT-20-LTLFireability-04
Product exploration explored 100000 steps with 2494 reset in 151 ms.
Product exploration explored 100000 steps with 800 reset in 175 ms.
Computed a total of 23 stabilizing places and 38 stable transitions
Graph (complete) has 1003 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 23 stabilizing places and 38 stable transitions
Detected a total of 23/495 stabilizing places and 38/691 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0 p3), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0 (NOT p3)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p1), (X (NOT (AND p2 (NOT p1) p0))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0 (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND p2 (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 155 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (562 resets) in 162 ms. (245 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40004 steps (140 resets) in 43 ms. (909 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (141 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (142 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (139 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (122 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (141 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (143 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (140 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
[2024-06-02 18:32:56] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 22/31 variables, 6/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 165/196 variables, 21/30 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 16/212 variables, 2/32 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 4/36 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 20/232 variables, 3/39 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 401/633 variables, 173/212 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/633 variables, 0/212 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 355/988 variables, 169/381 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/988 variables, 0/381 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 158/1146 variables, 92/473 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1146 variables, 0/473 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 32/1178 variables, 21/494 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1178 variables, 0/494 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 20 (OVERLAPS) 7/1185 variables, 5/499 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1185 variables, 0/499 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/1186 variables, 1/500 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1186 variables, 0/500 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1186 variables, 0/500 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 6 solved, 2 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/18 variables, 4/6 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 2/8 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 152/170 variables, 14/22 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 17/187 variables, 2/24 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 4/28 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/28 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 20/207 variables, 3/31 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/31 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 396/603 variables, 170/201 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/603 variables, 0/201 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 368/971 variables, 174/375 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/971 variables, 0/375 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 168/1139 variables, 97/472 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1139 variables, 0/472 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 35/1174 variables, 22/494 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1174 variables, 0/494 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 11/1185 variables, 7/501 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1185 variables, 0/501 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/1186 variables, 1/502 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1186 variables, 0/502 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1186 variables, 0/502 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 502 constraints, problems are : Problem set: 6 solved, 2 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 2/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1139ms problems are : Problem set: 6 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 77 ms.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 691/691 transitions.
Graph (trivial) has 532 edges and 495 vertex of which 3 / 495 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1000 edges and 493 vertex of which 476 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 476 transition count 439
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 212 rules applied. Total rules applied 449 place count 266 transition count 437
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 451 place count 265 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 452 place count 264 transition count 436
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 452 place count 264 transition count 387
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 550 place count 215 transition count 387
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 553 place count 212 transition count 384
Iterating global reduction 4 with 3 rules applied. Total rules applied 556 place count 212 transition count 384
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 559 place count 212 transition count 381
Performed 78 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 715 place count 134 transition count 280
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 726 place count 134 transition count 269
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 734 place count 126 transition count 256
Iterating global reduction 6 with 8 rules applied. Total rules applied 742 place count 126 transition count 256
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 750 place count 122 transition count 252
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 751 place count 122 transition count 251
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 752 place count 121 transition count 249
Iterating global reduction 7 with 1 rules applied. Total rules applied 753 place count 121 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 754 place count 121 transition count 248
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 830 place count 83 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 8 with 80 rules applied. Total rules applied 910 place count 83 transition count 208
Discarding 29 places :
Symmetric choice reduction at 9 with 29 rule applications. Total rules 939 place count 54 transition count 139
Iterating global reduction 9 with 29 rules applied. Total rules applied 968 place count 54 transition count 139
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 989 place count 54 transition count 118
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 995 place count 48 transition count 93
Iterating global reduction 10 with 6 rules applied. Total rules applied 1001 place count 48 transition count 93
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1006 place count 48 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 1008 place count 47 transition count 95
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1011 place count 47 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 12 with 7 rules applied. Total rules applied 1018 place count 47 transition count 85
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1019 place count 46 transition count 83
Iterating global reduction 12 with 1 rules applied. Total rules applied 1020 place count 46 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1021 place count 46 transition count 82
Free-agglomeration rule applied 11 times.
Iterating global reduction 13 with 11 rules applied. Total rules applied 1032 place count 46 transition count 71
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 13 with 13 rules applied. Total rules applied 1045 place count 35 transition count 69
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 1048 place count 35 transition count 69
Graph (complete) has 132 edges and 35 vertex of which 34 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 1049 place count 34 transition count 69
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 1052 place count 34 transition count 66
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 1055 place count 34 transition count 66
Graph (complete) has 124 edges and 34 vertex of which 33 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 1056 place count 33 transition count 66
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 1059 place count 33 transition count 63
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 1062 place count 33 transition count 63
Graph (complete) has 116 edges and 33 vertex of which 32 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 1063 place count 32 transition count 63
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 1066 place count 32 transition count 60
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 1069 place count 32 transition count 60
Graph (complete) has 108 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 20 with 1 rules applied. Total rules applied 1070 place count 31 transition count 60
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 1073 place count 31 transition count 57
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 22 with 3 rules applied. Total rules applied 1076 place count 31 transition count 57
Graph (complete) has 100 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 22 with 1 rules applied. Total rules applied 1077 place count 30 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 1080 place count 30 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 24 with 1 rules applied. Total rules applied 1081 place count 29 transition count 53
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 t376.t380.t568.t600 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 16 edges and 25 vertex of which 3 / 25 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 24 with 5 rules applied. Total rules applied 1086 place count 23 transition count 49
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 21 edges and 17 vertex of which 12 / 17 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
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 25 with 20 rules applied. Total rules applied 1106 place count 8 transition count 36
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (complete) has 6 edges and 7 vertex of which 5 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 26 with 32 rules applied. Total rules applied 1138 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 27 with 1 Pre rules applied. Total rules applied 1138 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 1140 place count 4 transition count 4
Applied a total of 1140 rules in 70 ms. Remains 4 /495 variables (removed 491) and now considering 4/691 (removed 687) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 4/495 places, 4/691 transitions.
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/2 properties
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0 p3), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0 (NOT p3)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p1), (X (NOT (AND p2 (NOT p1) p0))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0 (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND p2 (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1 (NOT p2) p3)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2 p3)), (G (OR (NOT p0) p1 p2 p3)), (G (OR (NOT p0) p1 (NOT p2))), (G (OR (NOT p0) p1 (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR p0 p1 (NOT p2)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p3)), (F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 32 factoid took 18 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-20-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-20-LTLFireability-04 finished in 63170 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 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 705
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 705
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 499 transition count 697
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 499 transition count 697
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 496 transition count 693
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 496 transition count 693
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 692
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 692
Applied a total of 44 rules in 27 ms. Remains 495 /517 variables (removed 22) and now considering 692/715 (removed 23) transitions.
// Phase 1: matrix 692 rows 495 cols
[2024-06-02 18:32:57] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:32:57] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 18:32:57] [INFO ] Invariant cache hit.
[2024-06-02 18:32:57] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 691 sub problems to find dead transitions.
[2024-06-02 18:32:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (OVERLAPS) 692/1187 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 691 unsolved
[2024-06-02 18:33:22] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-06-02 18:33:23] [INFO ] Deduced a trap composed of 188 places in 101 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1187/1187 variables, and 502 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 691 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (OVERLAPS) 692/1187 variables, 495/502 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1187 variables, 691/1193 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1187/1187 variables, and 1193 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 2/2 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
Starting structural reductions in LTL mode, iteration 1 : 495/517 places, 692/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60651 ms. Remains : 495/517 places, 692/715 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-05
Product exploration explored 100000 steps with 293 reset in 86 ms.
Product exploration explored 100000 steps with 685 reset in 101 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1009 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (839 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (145 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 604212 steps, run visited all 1 properties in 1356 ms. (steps per millisecond=445 )
Probabilistic random walk after 604212 steps, saw 113458 distinct states, run finished after 1359 ms. (steps per millisecond=444 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-20-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-20-LTLFireability-05 finished in 62571 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 2 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Graph (trivial) has 550 edges and 517 vertex of which 3 / 517 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1039 edges and 515 vertex of which 510 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 509 transition count 491
Reduce places removed 215 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 220 rules applied. Total rules applied 437 place count 294 transition count 486
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 440 place count 291 transition count 486
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 440 place count 291 transition count 438
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 536 place count 243 transition count 438
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 540 place count 239 transition count 434
Iterating global reduction 3 with 4 rules applied. Total rules applied 544 place count 239 transition count 434
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 544 place count 239 transition count 432
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 548 place count 237 transition count 432
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 551 place count 234 transition count 427
Iterating global reduction 3 with 3 rules applied. Total rules applied 554 place count 234 transition count 427
Performed 84 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 722 place count 150 transition count 317
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 733 place count 150 transition count 306
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 741 place count 142 transition count 293
Iterating global reduction 4 with 8 rules applied. Total rules applied 749 place count 142 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 751 place count 141 transition count 292
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 752 place count 140 transition count 290
Iterating global reduction 4 with 1 rules applied. Total rules applied 753 place count 140 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 754 place count 140 transition count 289
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 834 place count 100 transition count 334
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 853 place count 100 transition count 315
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 880 place count 73 transition count 207
Iterating global reduction 6 with 27 rules applied. Total rules applied 907 place count 73 transition count 207
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 925 place count 73 transition count 189
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 932 place count 66 transition count 151
Iterating global reduction 7 with 7 rules applied. Total rules applied 939 place count 66 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 944 place count 66 transition count 146
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 950 place count 63 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 8 with 41 rules applied. Total rules applied 991 place count 63 transition count 131
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 993 place count 61 transition count 129
Applied a total of 993 rules in 55 ms. Remains 61 /517 variables (removed 456) and now considering 129/715 (removed 586) transitions.
[2024-06-02 18:34:00] [INFO ] Flow matrix only has 111 transitions (discarded 18 similar events)
// Phase 1: matrix 111 rows 61 cols
[2024-06-02 18:34:00] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:34:00] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 18:34:00] [INFO ] Flow matrix only has 111 transitions (discarded 18 similar events)
[2024-06-02 18:34:00] [INFO ] Invariant cache hit.
[2024-06-02 18:34:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:34:00] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-06-02 18:34:00] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2024-06-02 18:34:00] [INFO ] Flow matrix only has 111 transitions (discarded 18 similar events)
[2024-06-02 18:34:00] [INFO ] Invariant cache hit.
[2024-06-02 18:34:00] [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, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 110/171 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 1/172 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/172 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 68 constraints, problems are : Problem set: 0 solved, 106 unsolved in 1528 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 110/171 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 106/173 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/172 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/172 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 174 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2010 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 3571ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 3573ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/517 places, 129/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3769 ms. Remains : 61/517 places, 129/715 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-06
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-06 finished in 3827 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 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Graph (trivial) has 553 edges and 517 vertex of which 3 / 517 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1039 edges and 515 vertex of which 510 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 218 place count 509 transition count 490
Reduce places removed 216 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 221 rules applied. Total rules applied 439 place count 293 transition count 485
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 442 place count 290 transition count 485
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 442 place count 290 transition count 437
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 538 place count 242 transition count 437
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 542 place count 238 transition count 433
Iterating global reduction 3 with 4 rules applied. Total rules applied 546 place count 238 transition count 433
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 546 place count 238 transition count 431
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 550 place count 236 transition count 431
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 553 place count 233 transition count 426
Iterating global reduction 3 with 3 rules applied. Total rules applied 556 place count 233 transition count 426
Performed 84 Post agglomeration using F-continuation condition with reduction of 25 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 724 place count 149 transition count 317
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 735 place count 149 transition count 306
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 743 place count 141 transition count 293
Iterating global reduction 4 with 8 rules applied. Total rules applied 751 place count 141 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 753 place count 140 transition count 292
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 754 place count 139 transition count 290
Iterating global reduction 4 with 1 rules applied. Total rules applied 755 place count 139 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 756 place count 139 transition count 289
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 5 with 82 rules applied. Total rules applied 838 place count 98 transition count 335
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 859 place count 98 transition count 314
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 887 place count 70 transition count 202
Iterating global reduction 6 with 28 rules applied. Total rules applied 915 place count 70 transition count 202
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 934 place count 70 transition count 183
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 941 place count 63 transition count 145
Iterating global reduction 7 with 7 rules applied. Total rules applied 948 place count 63 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 953 place count 63 transition count 140
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 961 place count 59 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 8 with 46 rules applied. Total rules applied 1007 place count 59 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1009 place count 57 transition count 133
Applied a total of 1009 rules in 49 ms. Remains 57 /517 variables (removed 460) and now considering 133/715 (removed 582) transitions.
[2024-06-02 18:34:03] [INFO ] Flow matrix only has 105 transitions (discarded 28 similar events)
// Phase 1: matrix 105 rows 57 cols
[2024-06-02 18:34:03] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 18:34:04] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 18:34:04] [INFO ] Flow matrix only has 105 transitions (discarded 28 similar events)
[2024-06-02 18:34:04] [INFO ] Invariant cache hit.
[2024-06-02 18:34:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:34:04] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-06-02 18:34:04] [INFO ] Redundant transitions in 0 ms returned []
Running 110 sub problems to find dead transitions.
[2024-06-02 18:34:04] [INFO ] Flow matrix only has 105 transitions (discarded 28 similar events)
[2024-06-02 18:34:04] [INFO ] Invariant cache hit.
[2024-06-02 18:34:04] [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, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 104/161 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 1/162 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 65 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1561 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 104/161 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 110/174 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/162 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 175 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 3652ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3653ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/517 places, 133/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3907 ms. Remains : 57/517 places, 133/715 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-10
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-10 finished in 3954 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 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Graph (trivial) has 551 edges and 517 vertex of which 3 / 517 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1039 edges and 515 vertex of which 508 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 214 rules applied. Total rules applied 216 place count 507 transition count 490
Reduce places removed 214 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 219 rules applied. Total rules applied 435 place count 293 transition count 485
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 439 place count 290 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 440 place count 289 transition count 484
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 440 place count 289 transition count 436
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 536 place count 241 transition count 436
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 540 place count 237 transition count 432
Iterating global reduction 4 with 4 rules applied. Total rules applied 544 place count 237 transition count 432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 544 place count 237 transition count 430
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 548 place count 235 transition count 430
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 551 place count 232 transition count 425
Iterating global reduction 4 with 3 rules applied. Total rules applied 554 place count 232 transition count 425
Performed 84 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 722 place count 148 transition count 315
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 733 place count 148 transition count 304
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 741 place count 140 transition count 291
Iterating global reduction 5 with 8 rules applied. Total rules applied 749 place count 140 transition count 291
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 751 place count 139 transition count 290
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 752 place count 138 transition count 288
Iterating global reduction 5 with 1 rules applied. Total rules applied 753 place count 138 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 754 place count 138 transition count 287
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 834 place count 98 transition count 332
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 854 place count 98 transition count 312
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 881 place count 71 transition count 204
Iterating global reduction 7 with 27 rules applied. Total rules applied 908 place count 71 transition count 204
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 926 place count 71 transition count 186
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 933 place count 64 transition count 148
Iterating global reduction 8 with 7 rules applied. Total rules applied 940 place count 64 transition count 148
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 945 place count 64 transition count 143
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 953 place count 60 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 9 with 48 rules applied. Total rules applied 1001 place count 60 transition count 138
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1003 place count 58 transition count 136
Applied a total of 1003 rules in 49 ms. Remains 58 /517 variables (removed 459) and now considering 136/715 (removed 579) transitions.
[2024-06-02 18:34:07] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
// Phase 1: matrix 107 rows 58 cols
[2024-06-02 18:34:07] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:34:07] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 18:34:07] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
[2024-06-02 18:34:07] [INFO ] Invariant cache hit.
[2024-06-02 18:34:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:34:08] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-06-02 18:34:08] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
[2024-06-02 18:34:08] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
[2024-06-02 18:34:08] [INFO ] Invariant cache hit.
[2024-06-02 18:34:08] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 106/164 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 1/165 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 66 constraints, problems are : Problem set: 0 solved, 113 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 3/3 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/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 106/164 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 113/178 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/165 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/165 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 179 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2216 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 3853ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 3854ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/517 places, 136/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4106 ms. Remains : 58/517 places, 136/715 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-12
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-12 finished in 4158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((G(F(p0))||(F(p0)&&G(p1)))))))))'
Support contains 2 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 705
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 705
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 499 transition count 696
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 499 transition count 696
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 496 transition count 692
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 496 transition count 692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 691
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 691
Applied a total of 44 rules in 25 ms. Remains 495 /517 variables (removed 22) and now considering 691/715 (removed 24) transitions.
// Phase 1: matrix 691 rows 495 cols
[2024-06-02 18:34:12] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:34:12] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-02 18:34:12] [INFO ] Invariant cache hit.
[2024-06-02 18:34:12] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2024-06-02 18:34:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-02 18:34:36] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2024-06-02 18:34:36] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2024-06-02 18:34:37] [INFO ] Deduced a trap composed of 188 places in 81 ms of which 2 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 1186/1186 variables, and 503 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-02 18:34:51] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:34:51] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 5 (OVERLAPS) 691/1186 variables, 495/505 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1186 variables, 690/1195 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1195 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 5/5 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Starting structural reductions in LTL mode, iteration 1 : 495/517 places, 691/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60743 ms. Remains : 495/517 places, 691/715 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-20-LTLFireability-14
Product exploration explored 100000 steps with 237 reset in 87 ms.
Product exploration explored 100000 steps with 481 reset in 97 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1008 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (611 resets) in 103 ms. (384 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (140 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (143 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
[2024-06-02 18:35:13] [INFO ] Invariant cache hit.
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) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/104 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/122 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/142 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 333/475 variables, 117/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 398/873 variables, 186/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/873 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 235/1108 variables, 128/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1108 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 69/1177 variables, 44/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1177 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/1186 variables, 7/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1186 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1186 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 0 solved, 2 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 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) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/104 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/122 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 20/142 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 333/475 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 398/873 variables, 186/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/873 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 235/1108 variables, 128/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1108 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 69/1177 variables, 44/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1177 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 9/1186 variables, 7/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1186 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1186 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 502 constraints, problems are : Problem set: 0 solved, 2 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 868ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 43 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=43 )
Parikh walk visited 2 properties in 0 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 691/691 transitions.
Applied a total of 0 rules in 12 ms. Remains 495 /495 variables (removed 0) and now considering 691/691 (removed 0) transitions.
[2024-06-02 18:35:15] [INFO ] Invariant cache hit.
[2024-06-02 18:35:15] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 18:35:15] [INFO ] Invariant cache hit.
[2024-06-02 18:35:15] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2024-06-02 18:35:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-02 18:35:39] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 3 ms to minimize.
[2024-06-02 18:35:39] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-06-02 18:35:40] [INFO ] Deduced a trap composed of 188 places in 73 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 503 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-02 18:35:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:35:55] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 5 (OVERLAPS) 691/1186 variables, 495/505 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1186 variables, 690/1195 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1195 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 5/5 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Finished structural reductions in LTL mode , in 1 iterations and 60615 ms. Remains : 495/495 places, 691/691 transitions.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1008 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (602 resets) in 142 ms. (279 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (143 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (140 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
[2024-06-02 18:36:16] [INFO ] Invariant cache hit.
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) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/104 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/122 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/142 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 333/475 variables, 117/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 398/873 variables, 186/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/873 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 235/1108 variables, 128/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1108 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 69/1177 variables, 44/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1177 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/1186 variables, 7/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1186 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1186 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 0 solved, 2 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 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) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/104 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/122 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 20/142 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 333/475 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 398/873 variables, 186/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/873 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 235/1108 variables, 128/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1108 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 69/1177 variables, 44/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1177 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 9/1186 variables, 7/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1186 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1186 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 502 constraints, problems are : Problem set: 0 solved, 2 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 849ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 43 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 167 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 319 reset in 84 ms.
Product exploration explored 100000 steps with 1853 reset in 144 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 495/495 places, 691/691 transitions.
Graph (trivial) has 529 edges and 495 vertex of which 3 / 495 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1006 edges and 493 vertex of which 488 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 203 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 203 rules applied. Total rules applied 205 place count 488 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 206 place count 488 transition count 682
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 206 place count 488 transition count 685
Deduced a syphon composed of 208 places in 1 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 488 transition count 685
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 271 place count 428 transition count 625
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 331 place count 428 transition count 625
Performed 105 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 436 place count 428 transition count 670
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 451 place count 428 transition count 655
Discarding 97 places :
Symmetric choice reduction at 3 with 97 rule applications. Total rules 548 place count 331 transition count 553
Deduced a syphon composed of 164 places in 1 ms
Iterating global reduction 3 with 97 rules applied. Total rules applied 645 place count 331 transition count 553
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 646 place count 330 transition count 552
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 647 place count 330 transition count 552
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 648 place count 330 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 649 place count 330 transition count 551
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 651 place count 328 transition count 549
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 653 place count 328 transition count 549
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 654 place count 328 transition count 549
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 656 place count 326 transition count 546
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 658 place count 326 transition count 546
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 660 place count 324 transition count 543
Deduced a syphon composed of 161 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 662 place count 324 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 663 place count 324 transition count 542
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 664 place count 323 transition count 541
Deduced a syphon composed of 160 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 665 place count 323 transition count 541
Performed 62 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 5 with 62 rules applied. Total rules applied 727 place count 323 transition count 847
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 5 with 55 rules applied. Total rules applied 782 place count 323 transition count 792
Discarding 106 places :
Symmetric choice reduction at 6 with 106 rule applications. Total rules 888 place count 217 transition count 493
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 6 with 106 rules applied. Total rules applied 994 place count 217 transition count 493
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 1024 place count 217 transition count 463
Discarding 67 places :
Symmetric choice reduction at 7 with 67 rule applications. Total rules 1091 place count 150 transition count 329
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 7 with 67 rules applied. Total rules applied 1158 place count 150 transition count 329
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1164 place count 150 transition count 323
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1177 place count 137 transition count 298
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 8 with 13 rules applied. Total rules applied 1190 place count 137 transition count 298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1194 place count 137 transition count 349
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1197 place count 134 transition count 343
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1200 place count 134 transition count 343
Deduced a syphon composed of 72 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 8 with 70 rules applied. Total rules applied 1270 place count 134 transition count 273
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1271 place count 133 transition count 272
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1272 place count 133 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1273 place count 133 transition count 293
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1275 place count 131 transition count 277
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1277 place count 131 transition count 277
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 1277 rules in 137 ms. Remains 131 /495 variables (removed 364) and now considering 277/691 (removed 414) transitions.
[2024-06-02 18:36:18] [INFO ] Redundant transitions in 2 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 18:36:18] [INFO ] Flow matrix only has 259 transitions (discarded 18 similar events)
// Phase 1: matrix 259 rows 131 cols
[2024-06-02 18:36:18] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:36:18] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:36:20] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-02 18:36:20] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-06-02 18:36:20] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-06-02 18:36:20] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-02 18:36:20] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 5/10 constraints. Problems are: Problem set: 15 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 261 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
At refinement iteration 4 (OVERLAPS) 258/389 variables, 131/141 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 32/173 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/173 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 1/390 variables, 1/174 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/174 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/174 constraints. Problems are: Problem set: 148 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 174 constraints, problems are : Problem set: 148 solved, 128 unsolved in 6757 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 131/131 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 148 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 16/76 variables, 5/5 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 5/10 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 244/320 variables, 76/86 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 32/118 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 128/246 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/246 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 69/389 variables, 55/301 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/301 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 1/390 variables, 1/302 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/302 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/390 variables, 0/302 constraints. Problems are: Problem set: 148 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 302 constraints, problems are : Problem set: 148 solved, 128 unsolved in 6195 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 131/131 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 128/276 constraints, Known Traps: 5/5 constraints]
After SMT, in 13031ms problems are : Problem set: 148 solved, 128 unsolved
Search for dead transitions found 148 dead transitions in 13034ms
Found 148 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 148 transitions
Dead transitions reduction (with SMT) removed 148 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 131/495 places, 129/691 transitions.
Graph (complete) has 268 edges and 131 vertex of which 61 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.1 ms
Discarding 70 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 61 transition count 142
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 9 rules in 10 ms. Remains 61 /131 variables (removed 70) and now considering 142/129 (removed -13) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/495 places, 142/691 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13193 ms. Remains : 61/495 places, 142/691 transitions.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 691/691 transitions.
Applied a total of 0 rules in 7 ms. Remains 495 /495 variables (removed 0) and now considering 691/691 (removed 0) transitions.
// Phase 1: matrix 691 rows 495 cols
[2024-06-02 18:36:31] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 18:36:32] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-02 18:36:32] [INFO ] Invariant cache hit.
[2024-06-02 18:36:32] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2024-06-02 18:36:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-02 18:36:56] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 3 ms to minimize.
[2024-06-02 18:36:56] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 3 ms to minimize.
[2024-06-02 18:36:57] [INFO ] Deduced a trap composed of 188 places in 85 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 503 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-02 18:37:11] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:37:11] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 5 (OVERLAPS) 691/1186 variables, 495/505 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1186 variables, 690/1195 constraints. Problems are: Problem set: 0 solved, 690 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 Int declared 1186/1186 variables, and 1195 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 5/5 constraints]
After SMT, in 60259ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Finished structural reductions in LTL mode , in 1 iterations and 60693 ms. Remains : 495/495 places, 691/691 transitions.
Treatment of property CO4-PT-20-LTLFireability-14 finished in 200679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X(p1) U G((p0 U p2))))))'
Support contains 3 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 705
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 705
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 499 transition count 696
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 499 transition count 696
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 497 transition count 693
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 497 transition count 693
Applied a total of 40 rules in 29 ms. Remains 497 /517 variables (removed 20) and now considering 693/715 (removed 22) transitions.
// Phase 1: matrix 693 rows 497 cols
[2024-06-02 18:37:32] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:37:32] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-02 18:37:32] [INFO ] Invariant cache hit.
[2024-06-02 18:37:33] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 692 sub problems to find dead transitions.
[2024-06-02 18:37:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (OVERLAPS) 693/1190 variables, 497/502 constraints. Problems are: Problem set: 0 solved, 692 unsolved
[2024-06-02 18:37:57] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 3 ms to minimize.
[2024-06-02 18:37:57] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 3 ms to minimize.
[2024-06-02 18:37:58] [INFO ] Deduced a trap composed of 187 places in 77 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1190/1190 variables, and 505 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 692 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 4 (OVERLAPS) 693/1190 variables, 497/505 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1190 variables, 692/1197 constraints. Problems are: Problem set: 0 solved, 692 unsolved
[2024-06-02 18:38:23] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1190/1190 variables, and 1198 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 4/4 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 692 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Starting structural reductions in LTL mode, iteration 1 : 497/517 places, 693/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60762 ms. Remains : 497/517 places, 693/715 transitions.
Stuttering acceptance computed with spot in 402 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : CO4-PT-20-LTLFireability-15
Product exploration explored 100000 steps with 25004 reset in 138 ms.
Product exploration explored 100000 steps with 24876 reset in 146 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1005 edges and 497 vertex of which 492 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (OR p2 p0)))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 116 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (827 resets) in 351 ms. (113 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40003 steps (119 resets) in 526 ms. (75 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (142 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (142 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (138 resets) in 76 ms. (519 steps per ms) remains 2/5 properties
[2024-06-02 18:38:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/42 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 237/279 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 17/296 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/316 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 447/763 variables, 203/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/763 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 308/1071 variables, 172/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1071 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 97/1168 variables, 61/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1168 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 20/1188 variables, 13/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1188 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1190 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1190 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1190 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1190/1190 variables, and 502 constraints, problems are : Problem set: 0 solved, 2 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/42 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 237/279 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 17/296 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 20/316 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 447/763 variables, 203/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/763 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 308/1071 variables, 172/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1071 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 97/1168 variables, 61/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1168 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 20/1188 variables, 13/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1188 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/1190 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1190 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1190 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1190/1190 variables, and 504 constraints, problems are : Problem set: 0 solved, 2 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1035ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 693/693 transitions.
Graph (trivial) has 530 edges and 497 vertex of which 3 / 497 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1002 edges and 495 vertex of which 478 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 236 rules applied. Total rules applied 238 place count 478 transition count 440
Reduce places removed 211 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 213 rules applied. Total rules applied 451 place count 267 transition count 438
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 454 place count 266 transition count 436
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 456 place count 264 transition count 436
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 456 place count 264 transition count 387
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 554 place count 215 transition count 387
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 557 place count 212 transition count 384
Iterating global reduction 4 with 3 rules applied. Total rules applied 560 place count 212 transition count 384
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 563 place count 212 transition count 381
Performed 76 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 715 place count 136 transition count 283
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 725 place count 136 transition count 273
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 733 place count 128 transition count 260
Iterating global reduction 6 with 8 rules applied. Total rules applied 741 place count 128 transition count 260
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 749 place count 124 transition count 256
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 750 place count 124 transition count 255
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 751 place count 123 transition count 253
Iterating global reduction 7 with 1 rules applied. Total rules applied 752 place count 123 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 753 place count 123 transition count 252
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 829 place count 85 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 8 with 79 rules applied. Total rules applied 908 place count 85 transition count 213
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 935 place count 58 transition count 150
Iterating global reduction 9 with 27 rules applied. Total rules applied 962 place count 58 transition count 150
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 980 place count 58 transition count 132
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 987 place count 51 transition count 103
Iterating global reduction 10 with 7 rules applied. Total rules applied 994 place count 51 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 999 place count 51 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1004 place count 51 transition count 93
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1005 place count 50 transition count 91
Iterating global reduction 11 with 1 rules applied. Total rules applied 1006 place count 50 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1007 place count 50 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1009 place count 49 transition count 100
Free-agglomeration rule applied 11 times.
Iterating global reduction 12 with 11 rules applied. Total rules applied 1020 place count 49 transition count 89
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 12 with 13 rules applied. Total rules applied 1033 place count 38 transition count 87
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1036 place count 38 transition count 87
Graph (complete) has 155 edges and 38 vertex of which 37 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 13 with 1 rules applied. Total rules applied 1037 place count 37 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1040 place count 37 transition count 84
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1043 place count 37 transition count 84
Graph (complete) has 147 edges and 37 vertex of which 36 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 15 with 1 rules applied. Total rules applied 1044 place count 36 transition count 84
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1047 place count 36 transition count 81
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 1050 place count 36 transition count 81
Graph (complete) has 139 edges and 36 vertex of which 35 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 17 with 1 rules applied. Total rules applied 1051 place count 35 transition count 81
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 1054 place count 35 transition count 78
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 1057 place count 35 transition count 78
Graph (complete) has 131 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 1 rules applied. Total rules applied 1058 place count 34 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 1061 place count 34 transition count 75
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 1064 place count 34 transition count 75
Graph (complete) has 123 edges and 34 vertex of which 33 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 21 with 1 rules applied. Total rules applied 1065 place count 33 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 1068 place count 33 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 1069 place count 32 transition count 71
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 t376.t380.t568.t600 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 18 edges and 28 vertex of which 3 / 28 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 23 with 5 rules applied. Total rules applied 1074 place count 26 transition count 67
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 24 edges and 20 vertex of which 11 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 24 with 18 rules applied. Total rules applied 1092 place count 11 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 25 with 36 rules applied. Total rules applied 1128 place count 11 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 26 with 4 rules applied. Total rules applied 1132 place count 11 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 1133 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 1134 place count 10 transition count 15
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 27 with 2 rules applied. Total rules applied 1136 place count 10 transition count 15
Applied a total of 1136 rules in 64 ms. Remains 10 /497 variables (removed 487) and now considering 15/693 (removed 678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 10/497 places, 15/693 transitions.
RANDOM walk for 16690 steps (5 resets) in 32 ms. (505 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (OR p2 p0)))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (OR (NOT p0) (NOT p1)) (OR (NOT p2) (NOT p1))))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p2) p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p0 p2 p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2 p1))), (F p0)]
Knowledge based reduction with 16 factoid took 575 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 447 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 414 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
[2024-06-02 18:38:37] [INFO ] Invariant cache hit.
[2024-06-02 18:38:38] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 18:38:38] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-06-02 18:38:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:38:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 18:38:38] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-06-02 18:38:38] [INFO ] Computed and/alt/rep : 674/1230/674 causal constraints (skipped 18 transitions) in 38 ms.
[2024-06-02 18:38:43] [INFO ] Added : 601 causal constraints over 121 iterations in 5203 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 693/693 transitions.
Applied a total of 0 rules in 8 ms. Remains 497 /497 variables (removed 0) and now considering 693/693 (removed 0) transitions.
[2024-06-02 18:38:43] [INFO ] Invariant cache hit.
[2024-06-02 18:38:43] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 18:38:43] [INFO ] Invariant cache hit.
[2024-06-02 18:38:44] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 692 sub problems to find dead transitions.
[2024-06-02 18:38:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (OVERLAPS) 693/1190 variables, 497/502 constraints. Problems are: Problem set: 0 solved, 692 unsolved
[2024-06-02 18:39:08] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 3 ms to minimize.
[2024-06-02 18:39:08] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-06-02 18:39:10] [INFO ] Deduced a trap composed of 187 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1190/1190 variables, and 505 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 692 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 4 (OVERLAPS) 693/1190 variables, 497/505 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1190 variables, 692/1197 constraints. Problems are: Problem set: 0 solved, 692 unsolved
[2024-06-02 18:39:34] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1190/1190 variables, and 1198 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 4/4 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 692 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Finished structural reductions in LTL mode , in 1 iterations and 60652 ms. Remains : 497/497 places, 693/693 transitions.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1005 edges and 497 vertex of which 492 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 89 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (836 resets) in 1216 ms. (32 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40004 steps (136 resets) in 190 ms. (209 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (139 resets) in 384 ms. (103 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (140 resets) in 321 ms. (124 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (124 resets) in 349 ms. (114 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (142 resets) in 221 ms. (180 steps per ms) remains 5/5 properties
[2024-06-02 18:39:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/42 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 237/279 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 17/296 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 20/316 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:39:45] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 447/763 variables, 203/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/763 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 308/1071 variables, 172/427 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1071 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 97/1168 variables, 61/488 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1168 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 20/1188 variables, 13/501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1188 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 2/1190 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1190 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/1190 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1190/1190 variables, and 503 constraints, problems are : Problem set: 0 solved, 5 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/42 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 237/279 variables, 31/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 17/296 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 20/316 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 447/763 variables, 203/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/763 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 308/1071 variables, 172/432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1071 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 97/1168 variables, 61/493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1168 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 20/1188 variables, 13/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1188 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 2/1190 variables, 2/508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1190 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/1190 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1190/1190 variables, and 508 constraints, problems are : Problem set: 0 solved, 5 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 1557ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 196 steps, including 2 resets, run visited all 5 properties in 8 ms. (steps per millisecond=24 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 9 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (OR (NOT p0) (NOT p1)) (OR (NOT p2) (NOT p1))))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p2) p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p0 p2 p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2 p1))), (F p0)]
Knowledge based reduction with 6 factoid took 470 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 401 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 376 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
[2024-06-02 18:39:48] [INFO ] Invariant cache hit.
[2024-06-02 18:39:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 18:39:48] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-06-02 18:39:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:39:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 18:39:49] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-06-02 18:39:49] [INFO ] Computed and/alt/rep : 674/1230/674 causal constraints (skipped 18 transitions) in 37 ms.
[2024-06-02 18:39:54] [INFO ] Added : 601 causal constraints over 121 iterations in 4954 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 405 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 19980 reset in 134 ms.
Product exploration explored 100000 steps with 19961 reset in 141 ms.
Applying partial POR strategy [false, false, true, false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 438 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 693/693 transitions.
Graph (trivial) has 530 edges and 497 vertex of which 3 / 497 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1003 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 204 rules applied. Total rules applied 206 place count 490 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 207 place count 490 transition count 684
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 207 place count 490 transition count 687
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 213 place count 490 transition count 687
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 274 place count 429 transition count 626
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 335 place count 429 transition count 626
Performed 105 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 440 place count 429 transition count 681
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 456 place count 429 transition count 665
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 552 place count 333 transition count 564
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 96 rules applied. Total rules applied 648 place count 333 transition count 564
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 649 place count 332 transition count 563
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 650 place count 332 transition count 563
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 651 place count 332 transition count 563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 652 place count 332 transition count 562
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 654 place count 330 transition count 560
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 656 place count 330 transition count 560
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 657 place count 330 transition count 560
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 659 place count 328 transition count 557
Deduced a syphon composed of 164 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 661 place count 328 transition count 557
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 663 place count 326 transition count 554
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 665 place count 326 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 666 place count 326 transition count 553
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 667 place count 325 transition count 552
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 668 place count 325 transition count 552
Performed 60 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 5 with 60 rules applied. Total rules applied 728 place count 325 transition count 853
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 5 with 56 rules applied. Total rules applied 784 place count 325 transition count 797
Discarding 99 places :
Symmetric choice reduction at 6 with 99 rule applications. Total rules 883 place count 226 transition count 526
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 6 with 99 rules applied. Total rules applied 982 place count 226 transition count 526
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 1010 place count 226 transition count 498
Discarding 63 places :
Symmetric choice reduction at 7 with 63 rule applications. Total rules 1073 place count 163 transition count 370
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 7 with 63 rules applied. Total rules applied 1136 place count 163 transition count 370
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1144 place count 163 transition count 362
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1157 place count 150 transition count 337
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 8 with 13 rules applied. Total rules applied 1170 place count 150 transition count 337
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1173 place count 150 transition count 388
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1183 place count 150 transition count 378
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1188 place count 145 transition count 356
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 1193 place count 145 transition count 356
Deduced a syphon composed of 78 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 9 with 48 rules applied. Total rules applied 1241 place count 145 transition count 308
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1242 place count 144 transition count 307
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1243 place count 144 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1244 place count 144 transition count 328
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1246 place count 142 transition count 312
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1248 place count 142 transition count 312
Deduced a syphon composed of 76 places in 0 ms
Applied a total of 1248 rules in 85 ms. Remains 142 /497 variables (removed 355) and now considering 312/693 (removed 381) transitions.
[2024-06-02 18:39:55] [INFO ] Redundant transitions in 1 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-02 18:39:55] [INFO ] Flow matrix only has 293 transitions (discarded 19 similar events)
// Phase 1: matrix 293 rows 142 cols
[2024-06-02 18:39:55] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:39:55] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 18:39:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 18:39:57] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-06-02 18:39:57] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-02 18:39:57] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-02 18:39:57] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 5/10 constraints. Problems are: Problem set: 15 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 296 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
At refinement iteration 4 (OVERLAPS) 292/434 variables, 142/152 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 26/178 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/178 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 1/435 variables, 1/179 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/179 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/179 constraints. Problems are: Problem set: 171 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 179 constraints, problems are : Problem set: 171 solved, 140 unsolved in 8118 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 142/142 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 171 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 16/81 variables, 5/5 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 5/10 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/10 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 276/357 variables, 81/91 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 26/117 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 140/257 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/257 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 77/434 variables, 61/318 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/318 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 1/435 variables, 1/319 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/319 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 0/435 variables, 0/319 constraints. Problems are: Problem set: 171 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 319 constraints, problems are : Problem set: 171 solved, 140 unsolved in 7550 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 142/142 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 140/311 constraints, Known Traps: 5/5 constraints]
After SMT, in 15764ms problems are : Problem set: 171 solved, 140 unsolved
Search for dead transitions found 171 dead transitions in 15767ms
Found 171 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 171 transitions
Dead transitions reduction (with SMT) removed 171 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 142/497 places, 141/693 transitions.
Graph (complete) has 287 edges and 142 vertex of which 66 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.1 ms
Discarding 76 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 154
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 66 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 10 rules in 12 ms. Remains 66 /142 variables (removed 76) and now considering 146/141 (removed -5) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/497 places, 146/693 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15870 ms. Remains : 66/497 places, 146/693 transitions.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 693/693 transitions.
Applied a total of 0 rules in 8 ms. Remains 497 /497 variables (removed 0) and now considering 693/693 (removed 0) transitions.
// Phase 1: matrix 693 rows 497 cols
[2024-06-02 18:40:11] [INFO ] Computed 5 invariants in 9 ms
[2024-06-02 18:40:11] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 18:40:11] [INFO ] Invariant cache hit.
[2024-06-02 18:40:11] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 692 sub problems to find dead transitions.
[2024-06-02 18:40:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (OVERLAPS) 693/1190 variables, 497/502 constraints. Problems are: Problem set: 0 solved, 692 unsolved
[2024-06-02 18:40:36] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
[2024-06-02 18:40:36] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:40:37] [INFO ] Deduced a trap composed of 187 places in 70 ms of which 1 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 1190/1190 variables, and 505 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 692 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 4 (OVERLAPS) 693/1190 variables, 497/505 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1190 variables, 692/1197 constraints. Problems are: Problem set: 0 solved, 692 unsolved
[2024-06-02 18:41:02] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1190/1190 variables, and 1198 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 4/4 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 692 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Finished structural reductions in LTL mode , in 1 iterations and 60692 ms. Remains : 497/497 places, 693/693 transitions.
Treatment of property CO4-PT-20-LTLFireability-15 finished in 219445 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))&&(p1 U (p2||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((G(F(p0))||(F(p0)&&G(p1)))))))))'
Found a Shortening insensitive property : CO4-PT-20-LTLFireability-14
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 517 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Graph (trivial) has 548 edges and 517 vertex of which 3 / 517 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1039 edges and 515 vertex of which 508 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 507 transition count 489
Reduce places removed 215 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 220 rules applied. Total rules applied 437 place count 292 transition count 484
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 441 place count 289 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 442 place count 288 transition count 483
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 442 place count 288 transition count 435
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 538 place count 240 transition count 435
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 541 place count 237 transition count 432
Iterating global reduction 4 with 3 rules applied. Total rules applied 544 place count 237 transition count 432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 544 place count 237 transition count 430
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 548 place count 235 transition count 430
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 550 place count 233 transition count 426
Iterating global reduction 4 with 2 rules applied. Total rules applied 552 place count 233 transition count 426
Performed 82 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 716 place count 151 transition count 321
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 727 place count 151 transition count 310
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 735 place count 143 transition count 297
Iterating global reduction 5 with 8 rules applied. Total rules applied 743 place count 143 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 745 place count 142 transition count 296
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 746 place count 141 transition count 294
Iterating global reduction 5 with 1 rules applied. Total rules applied 747 place count 141 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 748 place count 141 transition count 293
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 830 place count 100 transition count 339
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 850 place count 100 transition count 319
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 878 place count 72 transition count 207
Iterating global reduction 7 with 28 rules applied. Total rules applied 906 place count 72 transition count 207
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 924 place count 72 transition count 189
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 931 place count 65 transition count 151
Iterating global reduction 8 with 7 rules applied. Total rules applied 938 place count 65 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 942 place count 65 transition count 147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 950 place count 61 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 959 place count 61 transition count 179
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 961 place count 61 transition count 179
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 963 place count 61 transition count 177
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 965 place count 59 transition count 175
Applied a total of 965 rules in 50 ms. Remains 59 /517 variables (removed 458) and now considering 175/715 (removed 540) transitions.
[2024-06-02 18:41:12] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
// Phase 1: matrix 145 rows 59 cols
[2024-06-02 18:41:12] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:41:12] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 18:41:12] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2024-06-02 18:41:12] [INFO ] Invariant cache hit.
[2024-06-02 18:41:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:41:12] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-06-02 18:41:12] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2024-06-02 18:41:12] [INFO ] Invariant cache hit.
[2024-06-02 18:41:12] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 144/203 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 1/204 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 67 constraints, problems are : Problem set: 0 solved, 149 unsolved in 2442 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 144/203 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 149/215 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 1/204 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 216 constraints, problems are : Problem set: 0 solved, 149 unsolved in 3717 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 6224ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 6226ms
Starting structural reductions in LI_LTL mode, iteration 1 : 59/517 places, 175/715 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6378 ms. Remains : 59/517 places, 175/715 transitions.
Running random walk in product with property : CO4-PT-20-LTLFireability-14
Product exploration explored 100000 steps with 1759 reset in 65 ms.
Product exploration explored 100000 steps with 339 reset in 47 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 p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (3335 resets) in 114 ms. (347 steps per ms) remains 1/3 properties
BEST_FIRST walk for 31885 steps (208 resets) in 18 ms. (1678 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 354 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 175/175 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-06-02 18:41:20] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2024-06-02 18:41:20] [INFO ] Invariant cache hit.
[2024-06-02 18:41:20] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 18:41:20] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2024-06-02 18:41:20] [INFO ] Invariant cache hit.
[2024-06-02 18:41:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:41:20] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-06-02 18:41:20] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2024-06-02 18:41:20] [INFO ] Invariant cache hit.
[2024-06-02 18:41:20] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 144/203 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 1/204 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 67 constraints, problems are : Problem set: 0 solved, 149 unsolved in 2453 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 144/203 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 149/215 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 1/204 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 216 constraints, problems are : Problem set: 0 solved, 149 unsolved in 3604 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 6119ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 6120ms
Finished structural reductions in LTL mode , in 1 iterations and 6233 ms. Remains : 59/59 places, 175/175 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 p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
RANDOM walk for 38862 steps (3219 resets) in 136 ms. (283 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 153 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 313 reset in 50 ms.
Product exploration explored 100000 steps with 141 reset in 44 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 175/175 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 0 with 37 rules applied. Total rules applied 37 place count 59 transition count 138
Applied a total of 37 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 138/175 (removed 37) transitions.
[2024-06-02 18:41:28] [INFO ] Redundant transitions in 4 ms returned []
Running 115 sub problems to find dead transitions.
[2024-06-02 18:41:28] [INFO ] Flow matrix only has 110 transitions (discarded 28 similar events)
// Phase 1: matrix 110 rows 59 cols
[2024-06-02 18:41:28] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:41:28] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 109/168 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 1/169 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 67 constraints, problems are : Problem set: 0 solved, 115 unsolved in 1688 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 109/168 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 115/181 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 1/169 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 182 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2214 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 3943ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 3944ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/59 places, 138/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3960 ms. Remains : 59/59 places, 138/175 transitions.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 175/175 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-06-02 18:41:32] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
// Phase 1: matrix 145 rows 59 cols
[2024-06-02 18:41:32] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:41:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 18:41:32] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2024-06-02 18:41:32] [INFO ] Invariant cache hit.
[2024-06-02 18:41:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:41:32] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-06-02 18:41:32] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2024-06-02 18:41:32] [INFO ] Invariant cache hit.
[2024-06-02 18:41:32] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 144/203 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 1/204 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 67 constraints, problems are : Problem set: 0 solved, 149 unsolved in 2428 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 144/203 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 149/215 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 1/204 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 216 constraints, problems are : Problem set: 0 solved, 149 unsolved in 3460 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 5949ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 5951ms
Finished structural reductions in LTL mode , in 1 iterations and 6061 ms. Remains : 59/59 places, 175/175 transitions.
Treatment of property CO4-PT-20-LTLFireability-14 finished in 26294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X(p1) U G((p0 U p2))))))'
Found a Lengthening insensitive property : CO4-PT-20-LTLFireability-15
Stuttering acceptance computed with spot in 440 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Support contains 3 out of 517 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Graph (trivial) has 546 edges and 517 vertex of which 3 / 517 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1039 edges and 515 vertex of which 508 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 213 place count 507 transition count 493
Reduce places removed 211 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 216 rules applied. Total rules applied 429 place count 296 transition count 488
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 434 place count 293 transition count 486
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 436 place count 291 transition count 486
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 436 place count 291 transition count 438
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 532 place count 243 transition count 438
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 536 place count 239 transition count 434
Iterating global reduction 4 with 4 rules applied. Total rules applied 540 place count 239 transition count 434
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 540 place count 239 transition count 432
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 544 place count 237 transition count 432
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 547 place count 234 transition count 427
Iterating global reduction 4 with 3 rules applied. Total rules applied 550 place count 234 transition count 427
Performed 82 Post agglomeration using F-continuation condition with reduction of 25 identical transitions.
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 714 place count 152 transition count 320
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 724 place count 152 transition count 310
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 732 place count 144 transition count 297
Iterating global reduction 5 with 8 rules applied. Total rules applied 740 place count 144 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 742 place count 143 transition count 296
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 743 place count 142 transition count 294
Iterating global reduction 5 with 1 rules applied. Total rules applied 744 place count 142 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 745 place count 142 transition count 293
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 825 place count 102 transition count 338
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 844 place count 102 transition count 319
Discarding 26 places :
Symmetric choice reduction at 7 with 26 rule applications. Total rules 870 place count 76 transition count 215
Iterating global reduction 7 with 26 rules applied. Total rules applied 896 place count 76 transition count 215
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 912 place count 76 transition count 199
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 919 place count 69 transition count 161
Iterating global reduction 8 with 7 rules applied. Total rules applied 926 place count 69 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 931 place count 69 transition count 156
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 937 place count 66 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 947 place count 66 transition count 173
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 948 place count 66 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 949 place count 66 transition count 172
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 951 place count 64 transition count 170
Applied a total of 951 rules in 35 ms. Remains 64 /517 variables (removed 453) and now considering 170/715 (removed 545) transitions.
[2024-06-02 18:41:39] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
// Phase 1: matrix 150 rows 64 cols
[2024-06-02 18:41:39] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:41:39] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 18:41:39] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 18:41:39] [INFO ] Invariant cache hit.
[2024-06-02 18:41:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:41:39] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-06-02 18:41:39] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 18:41:39] [INFO ] Invariant cache hit.
[2024-06-02 18:41:39] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 149/213 variables, 64/69 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 1/214 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 71 constraints, problems are : Problem set: 0 solved, 144 unsolved in 2462 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 64/64 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 149/213 variables, 64/69 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 144/214 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 1/214 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 215 constraints, problems are : Problem set: 0 solved, 144 unsolved in 3335 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 64/64 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
After SMT, in 5856ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 5857ms
Starting structural reductions in LI_LTL mode, iteration 1 : 64/517 places, 170/715 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5997 ms. Remains : 64/517 places, 170/715 transitions.
Running random walk in product with property : CO4-PT-20-LTLFireability-15
Stuttering criterion allowed to conclude after 206 steps with 54 reset in 1 ms.
Treatment of property CO4-PT-20-LTLFireability-15 finished in 6567 ms.
FORMULA CO4-PT-20-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-02 18:41:45] [INFO ] Flatten gal took : 29 ms
[2024-06-02 18:41:45] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 18:41:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 517 places, 715 transitions and 1868 arcs took 6 ms.
Total runtime 737976 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CO4-PT-20-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CO4-PT-20-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CO4-PT-20-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717354189839

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-20-LTLFireability-00
ltl formula formula --ltl=/tmp/2405/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 517 places, 715 transitions and 1868 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2405/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2405/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2405/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.030 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2405/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 518 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 518, there are 740 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( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~94!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 860
pnml2lts-mc( 0/ 4): unique states count: 1218
pnml2lts-mc( 0/ 4): unique transitions count: 6127
pnml2lts-mc( 0/ 4): - self-loop count: 95
pnml2lts-mc( 0/ 4): - claim dead count: 3123
pnml2lts-mc( 0/ 4): - claim found count: 74
pnml2lts-mc( 0/ 4): - claim success count: 1227
pnml2lts-mc( 0/ 4): - cum. max stack depth: 301
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1227 states 6162 transitions, fanout: 5.022
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 40900, Transitions per second: 205400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 16.5 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 727 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name CO4-PT-20-LTLFireability-14
ltl formula formula --ltl=/tmp/2405/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 517 places, 715 transitions and 1868 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.070 real 0.030 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2405/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2405/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2405/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2405/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 519 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 518, there are 728 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): ~72 levels ~10000 states ~20340 transitions
pnml2lts-mc( 2/ 4): ~75 levels ~20000 states ~48364 transitions
pnml2lts-mc( 2/ 4): ~96 levels ~40000 states ~120092 transitions
pnml2lts-mc( 2/ 4): ~96 levels ~80000 states ~239980 transitions
pnml2lts-mc( 2/ 4): ~96 levels ~160000 states ~479752 transitions
pnml2lts-mc( 2/ 4): ~99 levels ~320000 states ~1115408 transitions
pnml2lts-mc( 2/ 4): ~99 levels ~640000 states ~2549832 transitions
pnml2lts-mc( 3/ 4): ~6086 levels ~1280000 states ~4048376 transitions
pnml2lts-mc( 2/ 4): ~99 levels ~2560000 states ~11875176 transitions
pnml2lts-mc( 2/ 4): ~1116 levels ~5120000 states ~24162208 transitions
pnml2lts-mc( 2/ 4): ~5218 levels ~10240000 states ~48141648 transitions
pnml2lts-mc( 2/ 4): ~5218 levels ~20480000 states ~96466304 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10895814
pnml2lts-mc( 0/ 4): unique states count: 33537568
pnml2lts-mc( 0/ 4): unique transitions count: 173950778
pnml2lts-mc( 0/ 4): - self-loop count: 18750
pnml2lts-mc( 0/ 4): - claim dead count: 83347360
pnml2lts-mc( 0/ 4): - claim found count: 57005407
pnml2lts-mc( 0/ 4): - claim success count: 33537579
pnml2lts-mc( 0/ 4): - cum. max stack depth: 53165
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33537579 states 173950801 transitions, fanout: 5.187
pnml2lts-mc( 0/ 4): Total exploration time 483.640 sec (483.610 sec minimum, 483.625 sec on average)
pnml2lts-mc( 0/ 4): States per second: 69344, Transitions per second: 359670
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 270.7MB, 8.5 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/22.0%
pnml2lts-mc( 0/ 4): Stored 727 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 270.7MB (~256.0MB paged-in)
ltl formula name CO4-PT-20-LTLFireability-15
ltl formula formula --ltl=/tmp/2405/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 517 places, 715 transitions and 1868 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.070 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2405/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2405/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2405/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2405/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4): There are 518 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 518, there are 815 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~41!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 133
pnml2lts-mc( 0/ 4): unique transitions count: 1105
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 148
pnml2lts-mc( 0/ 4): - cum. max stack depth: 148
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 148 states 1182 transitions, fanout: 7.986
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 14800, Transitions per second: 118200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 20.2 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 727 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

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