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.r400-tall-171690532100339.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 itstools
Input is StigmergyElection-PT-07b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532100339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 18:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 18:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.4M May 18 16:43 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 StigmergyElection-PT-07b-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-07b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717010138180

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 19:15:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 19:15:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:15:39] [INFO ] Load time of PNML (sax parser for PT used): 338 ms
[2024-05-29 19:15:39] [INFO ] Transformed 971 places.
[2024-05-29 19:15:39] [INFO ] Transformed 5542 transitions.
[2024-05-29 19:15:39] [INFO ] Found NUPN structural information;
[2024-05-29 19:15:39] [INFO ] Parsed PT model containing 971 places and 5542 transitions and 65199 arcs in 495 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyElection-PT-07b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 971 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 971/971 places, 5542/5542 transitions.
Discarding 116 places :
Symmetric choice reduction at 0 with 116 rule applications. Total rules 116 place count 855 transition count 5426
Iterating global reduction 0 with 116 rules applied. Total rules applied 232 place count 855 transition count 5426
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 294 place count 793 transition count 5364
Iterating global reduction 0 with 62 rules applied. Total rules applied 356 place count 793 transition count 5364
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 369 place count 780 transition count 5351
Iterating global reduction 0 with 13 rules applied. Total rules applied 382 place count 780 transition count 5351
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 387 place count 775 transition count 5346
Iterating global reduction 0 with 5 rules applied. Total rules applied 392 place count 775 transition count 5346
Applied a total of 392 rules in 452 ms. Remains 775 /971 variables (removed 196) and now considering 5346/5542 (removed 196) transitions.
// Phase 1: matrix 5346 rows 775 cols
[2024-05-29 19:15:40] [INFO ] Computed 8 invariants in 145 ms
[2024-05-29 19:15:42] [INFO ] Implicit Places using invariants in 1688 ms returned []
[2024-05-29 19:15:42] [INFO ] Invariant cache hit.
[2024-05-29 19:15:45] [INFO ] Implicit Places using invariants and state equation in 2771 ms returned []
Implicit Place search using SMT with State Equation took 4498 ms to find 0 implicit places.
Running 5345 sub problems to find dead transitions.
[2024-05-29 19:15:45] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 774/6121 variables, and 0 constraints, problems are : Problem set: 0 solved, 5345 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/775 constraints, PredecessorRefiner: 5345/959 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 774/6121 variables, and 0 constraints, problems are : Problem set: 0 solved, 5345 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/775 constraints, PredecessorRefiner: 4386/959 constraints, Known Traps: 0/0 constraints]
After SMT, in 118902ms problems are : Problem set: 0 solved, 5345 unsolved
Search for dead transitions found 0 dead transitions in 119003ms
Starting structural reductions in LTL mode, iteration 1 : 775/971 places, 5346/5542 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124004 ms. Remains : 775/971 places, 5346/5542 transitions.
Support contains 34 out of 775 places after structural reductions.
[2024-05-29 19:17:44] [INFO ] Flatten gal took : 568 ms
[2024-05-29 19:17:45] [INFO ] Flatten gal took : 397 ms
[2024-05-29 19:17:46] [INFO ] Input system was already deterministic with 5346 transitions.
Support contains 33 out of 775 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (328 resets) in 1644 ms. (24 steps per ms) remains 10/18 properties
BEST_FIRST walk for 40004 steps (46 resets) in 245 ms. (162 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (45 resets) in 184 ms. (216 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (46 resets) in 178 ms. (223 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (45 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (45 resets) in 178 ms. (223 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (45 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (46 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (44 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (47 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
[2024-05-29 19:17:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 740/761 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/761 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 14/775 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/775 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 5346/6121 variables, 775/783 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6121 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/6121 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6121/6121 variables, and 783 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3088 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 775/775 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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 740/761 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-29 19:17:52] [INFO ] Deduced a trap composed of 220 places in 1946 ms of which 52 ms to minimize.
[2024-05-29 19:17:54] [INFO ] Deduced a trap composed of 169 places in 1763 ms of which 5 ms to minimize.
[2024-05-29 19:17:56] [INFO ] Deduced a trap composed of 170 places in 1566 ms of which 4 ms to minimize.
SMT process timed out in 8625ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 19 out of 775 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 775/775 places, 5346/5346 transitions.
Graph (trivial) has 758 edges and 775 vertex of which 107 / 775 are part of one of the 19 SCC in 6 ms
Free SCC test removed 88 places
Drop transitions (Empty/Sink Transition effects.) removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Graph (complete) has 1786 edges and 687 vertex of which 680 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.34 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 452 transitions
Trivial Post-agglo rules discarded 452 transitions
Performed 452 trivial Post agglomeration. Transition count delta: 452
Iterating post reduction 0 with 458 rules applied. Total rules applied 460 place count 680 transition count 4769
Reduce places removed 452 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 462 rules applied. Total rules applied 922 place count 228 transition count 4759
Reduce places removed 5 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 11 rules applied. Total rules applied 933 place count 223 transition count 4753
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 941 place count 217 transition count 4751
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 942 place count 216 transition count 4751
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 942 place count 216 transition count 4715
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1014 place count 180 transition count 4715
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1015 place count 179 transition count 4713
Iterating global reduction 5 with 1 rules applied. Total rules applied 1016 place count 179 transition count 4713
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 4 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1088 place count 143 transition count 4677
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1098 place count 143 transition count 4667
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 1118 place count 123 transition count 751
Iterating global reduction 6 with 20 rules applied. Total rules applied 1138 place count 123 transition count 751
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1149 place count 123 transition count 740
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1151 place count 121 transition count 738
Iterating global reduction 7 with 2 rules applied. Total rules applied 1153 place count 121 transition count 738
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1171 place count 112 transition count 729
Performed 5 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1181 place count 107 transition count 736
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 1194 place count 107 transition count 723
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1196 place count 106 transition count 729
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1204 place count 106 transition count 721
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1206 place count 105 transition count 727
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1214 place count 105 transition count 719
Free-agglomeration rule applied 41 times.
Iterating global reduction 7 with 41 rules applied. Total rules applied 1255 place count 105 transition count 678
Reduce places removed 41 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 1297 place count 64 transition count 677
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1304 place count 57 transition count 670
Iterating global reduction 8 with 7 rules applied. Total rules applied 1311 place count 57 transition count 670
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1316 place count 57 transition count 665
Drop transitions (Redundant composition of simpler transitions.) removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 9 with 98 rules applied. Total rules applied 1414 place count 57 transition count 567
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1415 place count 57 transition count 567
Applied a total of 1415 rules in 1055 ms. Remains 57 /775 variables (removed 718) and now considering 567/5346 (removed 4779) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1055 ms. Remains : 57/775 places, 567/5346 transitions.
RANDOM walk for 27690 steps (431 resets) in 794 ms. (34 steps per ms) remains 0/9 properties
FORMULA StigmergyElection-PT-07b-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 105 stabilizing places and 112 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(X(p0))))||X(p0)))'
Support contains 2 out of 775 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 775/775 places, 5346/5346 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 766 transition count 5337
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 766 transition count 5337
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 764 transition count 5335
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 764 transition count 5335
Applied a total of 22 rules in 115 ms. Remains 764 /775 variables (removed 11) and now considering 5335/5346 (removed 11) transitions.
// Phase 1: matrix 5335 rows 764 cols
[2024-05-29 19:17:57] [INFO ] Computed 8 invariants in 82 ms
[2024-05-29 19:17:59] [INFO ] Implicit Places using invariants in 1536 ms returned []
[2024-05-29 19:17:59] [INFO ] Invariant cache hit.
[2024-05-29 19:18:02] [INFO ] Implicit Places using invariants and state equation in 2736 ms returned []
Implicit Place search using SMT with State Equation took 4275 ms to find 0 implicit places.
Running 5334 sub problems to find dead transitions.
[2024-05-29 19:18:02] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/6099 variables, and 0 constraints, problems are : Problem set: 0 solved, 5334 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/764 constraints, PredecessorRefiner: 5334/946 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5334 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/6099 variables, and 0 constraints, problems are : Problem set: 0 solved, 5334 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/764 constraints, PredecessorRefiner: 4388/946 constraints, Known Traps: 0/0 constraints]
After SMT, in 117870ms problems are : Problem set: 0 solved, 5334 unsolved
Search for dead transitions found 0 dead transitions in 117928ms
Starting structural reductions in LTL mode, iteration 1 : 764/775 places, 5335/5346 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122343 ms. Remains : 764/775 places, 5335/5346 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07b-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 523 ms.
Product exploration explored 100000 steps with 50000 reset in 505 ms.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-07b-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-07b-LTLCardinality-04 finished in 123779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)||(p0&&X(G(p2))))))'
Support contains 5 out of 775 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 775/775 places, 5346/5346 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 766 transition count 5337
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 766 transition count 5337
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 764 transition count 5335
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 764 transition count 5335
Applied a total of 22 rules in 146 ms. Remains 764 /775 variables (removed 11) and now considering 5335/5346 (removed 11) transitions.
// Phase 1: matrix 5335 rows 764 cols
[2024-05-29 19:20:01] [INFO ] Computed 8 invariants in 46 ms
[2024-05-29 19:20:02] [INFO ] Implicit Places using invariants in 1276 ms returned []
[2024-05-29 19:20:02] [INFO ] Invariant cache hit.
[2024-05-29 19:20:05] [INFO ] Implicit Places using invariants and state equation in 2804 ms returned []
Implicit Place search using SMT with State Equation took 4083 ms to find 0 implicit places.
Running 5334 sub problems to find dead transitions.
[2024-05-29 19:20:05] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 timeout
1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/6099 variables, and 0 constraints, problems are : Problem set: 0 solved, 5334 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/764 constraints, PredecessorRefiner: 5334/947 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/6099 variables, and 0 constraints, problems are : Problem set: 0 solved, 5334 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/764 constraints, PredecessorRefiner: 4387/947 constraints, Known Traps: 0/0 constraints]
After SMT, in 118824ms problems are : Problem set: 0 solved, 5334 unsolved
Search for dead transitions found 0 dead transitions in 118872ms
Starting structural reductions in LTL mode, iteration 1 : 764/775 places, 5335/5346 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123129 ms. Remains : 764/775 places, 5335/5346 transitions.
Stuttering acceptance computed with spot in 290 ms :[true, (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : StigmergyElection-PT-07b-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 383 ms.
Product exploration explored 100000 steps with 50000 reset in 468 ms.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 19 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-07b-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-07b-LTLCardinality-06 finished in 124516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 775 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 775/775 places, 5346/5346 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 766 transition count 5337
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 766 transition count 5337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 765 transition count 5336
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 765 transition count 5336
Applied a total of 20 rules in 143 ms. Remains 765 /775 variables (removed 10) and now considering 5336/5346 (removed 10) transitions.
// Phase 1: matrix 5336 rows 765 cols
[2024-05-29 19:22:06] [INFO ] Computed 8 invariants in 61 ms
[2024-05-29 19:22:07] [INFO ] Implicit Places using invariants in 1330 ms returned []
[2024-05-29 19:22:07] [INFO ] Invariant cache hit.
[2024-05-29 19:22:10] [INFO ] Implicit Places using invariants and state equation in 2789 ms returned []
Implicit Place search using SMT with State Equation took 4124 ms to find 0 implicit places.
Running 5335 sub problems to find dead transitions.
[2024-05-29 19:22:10] [INFO ] Invariant cache hit.
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 764/6101 variables, and 0 constraints, problems are : Problem set: 0 solved, 5335 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/765 constraints, PredecessorRefiner: 5335/947 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/6101 variables, and 0 constraints, problems are : Problem set: 0 solved, 5335 unsolved in 30117 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/765 constraints, PredecessorRefiner: 4388/947 constraints, Known Traps: 0/0 constraints]
After SMT, in 119681ms problems are : Problem set: 0 solved, 5335 unsolved
Search for dead transitions found 0 dead transitions in 119728ms
Starting structural reductions in LTL mode, iteration 1 : 765/775 places, 5336/5346 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124007 ms. Remains : 765/775 places, 5336/5346 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-07b-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 396 ms.
Product exploration explored 100000 steps with 50000 reset in 446 ms.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-07b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-07b-LTLCardinality-08 finished in 125044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 775 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 775/775 places, 5346/5346 transitions.
Graph (trivial) has 789 edges and 775 vertex of which 118 / 775 are part of one of the 21 SCC in 3 ms
Free SCC test removed 97 places
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 464 transitions
Trivial Post-agglo rules discarded 464 transitions
Performed 464 trivial Post agglomeration. Transition count delta: 464
Iterating post reduction 0 with 464 rules applied. Total rules applied 465 place count 677 transition count 4771
Reduce places removed 464 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 478 rules applied. Total rules applied 943 place count 213 transition count 4757
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 950 place count 206 transition count 4757
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 950 place count 206 transition count 4729
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1006 place count 178 transition count 4729
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1015 place count 169 transition count 4719
Iterating global reduction 3 with 9 rules applied. Total rules applied 1024 place count 169 transition count 4719
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1024 place count 169 transition count 4717
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1028 place count 167 transition count 4717
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1030 place count 165 transition count 3986
Iterating global reduction 3 with 2 rules applied. Total rules applied 1032 place count 165 transition count 3986
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1033 place count 165 transition count 3985
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1034 place count 164 transition count 3983
Iterating global reduction 4 with 1 rules applied. Total rules applied 1035 place count 164 transition count 3983
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 1097 place count 133 transition count 3952
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1121 place count 109 transition count 547
Iterating global reduction 4 with 24 rules applied. Total rules applied 1145 place count 109 transition count 547
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1157 place count 109 transition count 535
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1162 place count 104 transition count 525
Iterating global reduction 5 with 5 rules applied. Total rules applied 1167 place count 104 transition count 525
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1172 place count 99 transition count 515
Iterating global reduction 5 with 5 rules applied. Total rules applied 1177 place count 99 transition count 515
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1201 place count 87 transition count 522
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1202 place count 86 transition count 506
Iterating global reduction 5 with 1 rules applied. Total rules applied 1203 place count 86 transition count 506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1204 place count 86 transition count 505
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1212 place count 86 transition count 497
Applied a total of 1212 rules in 477 ms. Remains 86 /775 variables (removed 689) and now considering 497/5346 (removed 4849) transitions.
[2024-05-29 19:24:11] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
// Phase 1: matrix 488 rows 86 cols
[2024-05-29 19:24:11] [INFO ] Computed 2 invariants in 10 ms
[2024-05-29 19:24:11] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-29 19:24:11] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
[2024-05-29 19:24:11] [INFO ] Invariant cache hit.
[2024-05-29 19:24:11] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 19:24:12] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-05-29 19:24:12] [INFO ] Redundant transitions in 31 ms returned []
Running 480 sub problems to find dead transitions.
[2024-05-29 19:24:12] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
[2024-05-29 19:24:12] [INFO ] Invariant cache hit.
[2024-05-29 19:24:12] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:24:15] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2024-05-29 19:24:15] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 0 ms to minimize.
[2024-05-29 19:24:15] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2024-05-29 19:24:15] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2024-05-29 19:24:16] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 1 ms to minimize.
[2024-05-29 19:24:16] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2024-05-29 19:24:16] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 1 ms to minimize.
[2024-05-29 19:24:16] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 1 ms to minimize.
[2024-05-29 19:24:16] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 0 ms to minimize.
[2024-05-29 19:24:16] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-05-29 19:24:16] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2024-05-29 19:24:17] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2024-05-29 19:24:17] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2024-05-29 19:24:17] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2024-05-29 19:24:17] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2024-05-29 19:24:17] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2024-05-29 19:24:18] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:24:18] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2024-05-29 19:24:19] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2024-05-29 19:24:19] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:24:20] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 1 ms to minimize.
[2024-05-29 19:24:20] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:24:21] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2024-05-29 19:24:21] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:24:21] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2024-05-29 19:24:21] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2024-05-29 19:24:22] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2024-05-29 19:24:22] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2024-05-29 19:24:22] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:24:22] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2024-05-29 19:24:22] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2024-05-29 19:24:22] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-05-29 19:24:22] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 0 ms to minimize.
[2024-05-29 19:24:22] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-29 19:24:23] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2024-05-29 19:24:23] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:24:23] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2024-05-29 19:24:23] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:24:23] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:24:23] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2024-05-29 19:24:23] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2024-05-29 19:24:25] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2024-05-29 19:24:25] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2024-05-29 19:24:25] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (OVERLAPS) 487/573 variables, 86/132 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 126/258 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:24:32] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 0 ms to minimize.
[2024-05-29 19:24:34] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/574 variables, and 260 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (OVERLAPS) 487/573 variables, 86/134 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 126/260 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 480/740 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/574 variables, and 740 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 46/46 constraints]
After SMT, in 61467ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 61471ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/775 places, 497/5346 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62495 ms. Remains : 86/775 places, 497/5346 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07b-LTLCardinality-10
Product exploration explored 100000 steps with 7948 reset in 382 ms.
Product exploration explored 100000 steps with 7955 reset in 311 ms.
Computed a total of 5 stabilizing places and 23 stable transitions
Computed a total of 5 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3159 resets) in 1516 ms. (26 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (268 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1709163 steps, run timeout after 3001 ms. (steps per millisecond=569 ) properties seen :0 out of 1
Probabilistic random walk after 1709163 steps, saw 299704 distinct states, run finished after 3004 ms. (steps per millisecond=568 ) properties seen :0
[2024-05-29 19:25:17] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
[2024-05-29 19:25:17] [INFO ] Invariant cache hit.
[2024-05-29 19:25:17] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 486/570 variables, 84/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 126/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/573 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/574 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/574 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:25:18] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 1 ms to minimize.
[2024-05-29 19:25:18] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 486/570 variables, 84/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 126/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/573 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/574 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:25:18] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 0 ms to minimize.
[2024-05-29 19:25:19] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/574 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1202ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 497/497 transitions.
Graph (complete) has 579 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 85 transition count 480
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 17 place count 85 transition count 479
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 84 transition count 479
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 26 rules applied. Total rules applied 45 place count 71 transition count 466
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 70 transition count 466
Free-agglomeration rule applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 84 place count 70 transition count 429
Reduce places removed 38 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 124 place count 32 transition count 427
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 124 place count 32 transition count 426
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 126 place count 31 transition count 426
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 133 place count 24 transition count 419
Iterating global reduction 2 with 7 rules applied. Total rules applied 140 place count 24 transition count 419
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 203 place count 24 transition count 356
Performed 8 Post agglomeration using F-continuation condition with reduction of 306 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 222 place count 13 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 249 place count 13 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 254 place count 10 transition count 13
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 10 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 256 place count 10 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 258 place count 8 transition count 10
Applied a total of 258 rules in 69 ms. Remains 8 /86 variables (removed 78) and now considering 10/497 (removed 487) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 8/86 places, 10/497 transitions.
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 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 278 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 497/497 transitions.
Applied a total of 0 rules in 16 ms. Remains 86 /86 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2024-05-29 19:25:19] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
[2024-05-29 19:25:19] [INFO ] Invariant cache hit.
[2024-05-29 19:25:19] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-29 19:25:19] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
[2024-05-29 19:25:19] [INFO ] Invariant cache hit.
[2024-05-29 19:25:19] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 19:25:20] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2024-05-29 19:25:20] [INFO ] Redundant transitions in 5 ms returned []
Running 480 sub problems to find dead transitions.
[2024-05-29 19:25:20] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
[2024-05-29 19:25:20] [INFO ] Invariant cache hit.
[2024-05-29 19:25:20] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:25:23] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
[2024-05-29 19:25:24] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2024-05-29 19:25:24] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 1 ms to minimize.
[2024-05-29 19:25:24] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2024-05-29 19:25:24] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2024-05-29 19:25:24] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 0 ms to minimize.
[2024-05-29 19:25:24] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:25:25] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2024-05-29 19:25:25] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2024-05-29 19:25:25] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2024-05-29 19:25:25] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:25:25] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2024-05-29 19:25:25] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:25:25] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2024-05-29 19:25:25] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2024-05-29 19:25:26] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2024-05-29 19:25:26] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-05-29 19:25:27] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 0 ms to minimize.
[2024-05-29 19:25:27] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2024-05-29 19:25:27] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:25:28] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 1 ms to minimize.
[2024-05-29 19:25:28] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2024-05-29 19:25:30] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2024-05-29 19:25:30] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 0 ms to minimize.
[2024-05-29 19:25:30] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2024-05-29 19:25:30] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:25:30] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2024-05-29 19:25:30] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:25:30] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:25:30] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 1 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 0 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 0 ms to minimize.
[2024-05-29 19:25:32] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:25:32] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2024-05-29 19:25:32] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2024-05-29 19:25:33] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:25:34] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2024-05-29 19:25:34] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (OVERLAPS) 487/573 variables, 86/132 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 126/258 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:25:41] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2024-05-29 19:25:42] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/574 variables, and 260 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (OVERLAPS) 487/573 variables, 86/134 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 126/260 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 480/740 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/574 variables, and 740 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 46/46 constraints]
After SMT, in 61779ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 61783ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62408 ms. Remains : 86/86 places, 497/497 transitions.
Computed a total of 5 stabilizing places and 23 stable transitions
Computed a total of 5 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 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 37 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3165 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (261 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1762854 steps, run timeout after 3001 ms. (steps per millisecond=587 ) properties seen :0 out of 1
Probabilistic random walk after 1762854 steps, saw 309780 distinct states, run finished after 3006 ms. (steps per millisecond=586 ) properties seen :0
[2024-05-29 19:26:25] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
[2024-05-29 19:26:25] [INFO ] Invariant cache hit.
[2024-05-29 19:26:25] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 486/570 variables, 84/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 126/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/573 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/574 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/574 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:26:25] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 1 ms to minimize.
[2024-05-29 19:26:25] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 486/570 variables, 84/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 126/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/573 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/574 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:26:26] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 1 ms to minimize.
[2024-05-29 19:26:26] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/574 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1080ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 497/497 transitions.
Graph (complete) has 579 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 85 transition count 480
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 17 place count 85 transition count 479
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 84 transition count 479
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 26 rules applied. Total rules applied 45 place count 71 transition count 466
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 70 transition count 466
Free-agglomeration rule applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 84 place count 70 transition count 429
Reduce places removed 38 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 124 place count 32 transition count 427
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 124 place count 32 transition count 426
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 126 place count 31 transition count 426
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 133 place count 24 transition count 419
Iterating global reduction 2 with 7 rules applied. Total rules applied 140 place count 24 transition count 419
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 203 place count 24 transition count 356
Performed 8 Post agglomeration using F-continuation condition with reduction of 306 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 222 place count 13 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 249 place count 13 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 254 place count 10 transition count 13
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 10 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 256 place count 10 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 258 place count 8 transition count 10
Applied a total of 258 rules in 46 ms. Remains 8 /86 variables (removed 78) and now considering 10/497 (removed 487) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 8/86 places, 10/497 transitions.
RANDOM walk for 66 steps (0 resets) in 4 ms. (13 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 97 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7979 reset in 230 ms.
Product exploration explored 100000 steps with 7966 reset in 237 ms.
Built C files in :
/tmp/ltsmin2378667001543256354
[2024-05-29 19:26:27] [INFO ] Computing symmetric may disable matrix : 497 transitions.
[2024-05-29 19:26:27] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:26:27] [INFO ] Computing symmetric may enable matrix : 497 transitions.
[2024-05-29 19:26:27] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:26:27] [INFO ] Computing Do-Not-Accords matrix : 497 transitions.
[2024-05-29 19:26:27] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:26:27] [INFO ] Built C files in 134ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2378667001543256354
Running compilation step : cd /tmp/ltsmin2378667001543256354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2051 ms.
Running link step : cd /tmp/ltsmin2378667001543256354;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin2378667001543256354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1298857504169513054.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 497/497 transitions.
Applied a total of 0 rules in 18 ms. Remains 86 /86 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2024-05-29 19:26:42] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
[2024-05-29 19:26:42] [INFO ] Invariant cache hit.
[2024-05-29 19:26:42] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-29 19:26:42] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
[2024-05-29 19:26:42] [INFO ] Invariant cache hit.
[2024-05-29 19:26:42] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 19:26:42] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-05-29 19:26:42] [INFO ] Redundant transitions in 2 ms returned []
Running 480 sub problems to find dead transitions.
[2024-05-29 19:26:42] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
[2024-05-29 19:26:42] [INFO ] Invariant cache hit.
[2024-05-29 19:26:42] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:26:46] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2024-05-29 19:26:46] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2024-05-29 19:26:46] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 0 ms to minimize.
[2024-05-29 19:26:46] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2024-05-29 19:26:46] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2024-05-29 19:26:46] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2024-05-29 19:26:46] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2024-05-29 19:26:47] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 0 ms to minimize.
[2024-05-29 19:26:47] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 0 ms to minimize.
[2024-05-29 19:26:47] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2024-05-29 19:26:47] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2024-05-29 19:26:47] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:26:47] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2024-05-29 19:26:47] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2024-05-29 19:26:47] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2024-05-29 19:26:48] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2024-05-29 19:26:48] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 19:26:49] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2024-05-29 19:26:49] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2024-05-29 19:26:49] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:26:50] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 1 ms to minimize.
[2024-05-29 19:26:50] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2024-05-29 19:26:52] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:26:52] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:26:52] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2024-05-29 19:26:52] [INFO ] Deduced a trap composed of 21 places in 273 ms of which 1 ms to minimize.
[2024-05-29 19:26:52] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:26:52] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2024-05-29 19:26:52] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2024-05-29 19:26:53] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 1 ms to minimize.
[2024-05-29 19:26:53] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:26:53] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:26:53] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
[2024-05-29 19:26:53] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:26:53] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2024-05-29 19:26:53] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2024-05-29 19:26:53] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 1 ms to minimize.
[2024-05-29 19:26:54] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 1 ms to minimize.
[2024-05-29 19:26:54] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:26:54] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2024-05-29 19:26:54] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2024-05-29 19:26:56] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2024-05-29 19:26:56] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 1 ms to minimize.
[2024-05-29 19:26:56] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (OVERLAPS) 487/573 variables, 86/132 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 126/258 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:27:03] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2024-05-29 19:27:05] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/574 variables, and 260 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (OVERLAPS) 487/573 variables, 86/134 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 126/260 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 480/740 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/574 variables, and 740 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 46/46 constraints]
After SMT, in 61512ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 61516ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62049 ms. Remains : 86/86 places, 497/497 transitions.
Built C files in :
/tmp/ltsmin3014102364353726304
[2024-05-29 19:27:44] [INFO ] Computing symmetric may disable matrix : 497 transitions.
[2024-05-29 19:27:44] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:27:44] [INFO ] Computing symmetric may enable matrix : 497 transitions.
[2024-05-29 19:27:44] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:27:44] [INFO ] Computing Do-Not-Accords matrix : 497 transitions.
[2024-05-29 19:27:44] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 19:27:44] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3014102364353726304
Running compilation step : cd /tmp/ltsmin3014102364353726304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1843 ms.
Running link step : cd /tmp/ltsmin3014102364353726304;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin3014102364353726304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13296665016265034482.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 19:27:59] [INFO ] Flatten gal took : 50 ms
[2024-05-29 19:27:59] [INFO ] Flatten gal took : 46 ms
[2024-05-29 19:27:59] [INFO ] Time to serialize gal into /tmp/LTL9477978747390831517.gal : 16 ms
[2024-05-29 19:27:59] [INFO ] Time to serialize properties into /tmp/LTL6346848443857633815.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9477978747390831517.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14490270699069124065.hoa' '-atoms' '/tmp/LTL6346848443857633815.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6346848443857633815.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14490270699069124065.hoa
Detected timeout of ITS tools.
[2024-05-29 19:28:15] [INFO ] Flatten gal took : 35 ms
[2024-05-29 19:28:15] [INFO ] Flatten gal took : 35 ms
[2024-05-29 19:28:15] [INFO ] Time to serialize gal into /tmp/LTL3196810401030891926.gal : 7 ms
[2024-05-29 19:28:15] [INFO ] Time to serialize properties into /tmp/LTL8432002836633668248.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3196810401030891926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8432002836633668248.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((p652!=1)||((p495!=0)&&(p423!=1)))"))))
Formula 0 simplified : GF!"((p652!=1)||((p495!=0)&&(p423!=1)))"
Detected timeout of ITS tools.
[2024-05-29 19:28:30] [INFO ] Flatten gal took : 34 ms
[2024-05-29 19:28:30] [INFO ] Applying decomposition
[2024-05-29 19:28:30] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2840673664733837439.txt' '-o' '/tmp/graph2840673664733837439.bin' '-w' '/tmp/graph2840673664733837439.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2840673664733837439.bin' '-l' '-1' '-v' '-w' '/tmp/graph2840673664733837439.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:28:30] [INFO ] Decomposing Gal with order
[2024-05-29 19:28:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:28:30] [INFO ] Removed a total of 2722 redundant transitions.
[2024-05-29 19:28:30] [INFO ] Flatten gal took : 119 ms
[2024-05-29 19:28:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 28 ms.
[2024-05-29 19:28:30] [INFO ] Time to serialize gal into /tmp/LTL8918951724725530927.gal : 6 ms
[2024-05-29 19:28:30] [INFO ] Time to serialize properties into /tmp/LTL4789494092318433832.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8918951724725530927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4789494092318433832.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((i5.u18.p652!=1)||((i3.u13.p495!=0)&&(i3.u9.p423!=1)))"))))
Formula 0 simplified : GF!"((i5.u18.p652!=1)||((i3.u13.p495!=0)&&(i3.u9.p423!=1)))"
Detected timeout of ITS tools.
Treatment of property StigmergyElection-PT-07b-LTLCardinality-10 finished in 274630 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 G((p0 U p1))))'
Support contains 3 out of 775 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 775/775 places, 5346/5346 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 765 transition count 5336
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 765 transition count 5336
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 763 transition count 5334
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 763 transition count 5334
Applied a total of 24 rules in 128 ms. Remains 763 /775 variables (removed 12) and now considering 5334/5346 (removed 12) transitions.
// Phase 1: matrix 5334 rows 763 cols
[2024-05-29 19:28:45] [INFO ] Computed 8 invariants in 91 ms
[2024-05-29 19:28:47] [INFO ] Implicit Places using invariants in 1368 ms returned []
[2024-05-29 19:28:47] [INFO ] Invariant cache hit.
[2024-05-29 19:28:49] [INFO ] Implicit Places using invariants and state equation in 2721 ms returned []
Implicit Place search using SMT with State Equation took 4099 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-05-29 19:28:50] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 119995ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 120042ms
Starting structural reductions in LTL mode, iteration 1 : 763/775 places, 5334/5346 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124297 ms. Remains : 763/775 places, 5334/5346 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-07b-LTLCardinality-12
Product exploration explored 100000 steps with 24997 reset in 321 ms.
Product exploration explored 100000 steps with 25088 reset in 389 ms.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (OR p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (OR p1 p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 104 ms. Reduced automaton from 8 states, 18 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1), true]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (325 resets) in 159 ms. (250 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (44 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
[2024-05-29 19:30:51] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 322/325 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 438/763 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6097/6097 variables, and 771 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1426 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 322/325 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 438/763 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5334/6097 variables, 763/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6097 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6097 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/6097 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6097/6097 variables, and 772 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1803 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3249ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 9442 steps, including 79 resets, run visited all 1 properties in 39 ms. (steps per millisecond=242 )
Parikh walk visited 1 properties in 51 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (OR p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (OR p1 p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 13 factoid took 221 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-07b-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-07b-LTLCardinality-12 finished in 129215 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))||G(p1))))'
Support contains 4 out of 775 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 775/775 places, 5346/5346 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 767 transition count 5338
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 767 transition count 5338
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 766 transition count 5337
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 766 transition count 5337
Applied a total of 18 rules in 124 ms. Remains 766 /775 variables (removed 9) and now considering 5337/5346 (removed 9) transitions.
// Phase 1: matrix 5337 rows 766 cols
[2024-05-29 19:30:55] [INFO ] Computed 8 invariants in 72 ms
[2024-05-29 19:30:56] [INFO ] Implicit Places using invariants in 1366 ms returned []
[2024-05-29 19:30:56] [INFO ] Invariant cache hit.
[2024-05-29 19:30:59] [INFO ] Implicit Places using invariants and state equation in 2942 ms returned []
Implicit Place search using SMT with State Equation took 4311 ms to find 0 implicit places.
Running 5336 sub problems to find dead transitions.
[2024-05-29 19:30:59] [INFO ] Invariant cache hit.
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 765/6103 variables, and 0 constraints, problems are : Problem set: 0 solved, 5336 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/766 constraints, PredecessorRefiner: 5336/949 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5336 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/6103 variables, and 0 constraints, problems are : Problem set: 0 solved, 5336 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/766 constraints, PredecessorRefiner: 4387/949 constraints, Known Traps: 0/0 constraints]
After SMT, in 120462ms problems are : Problem set: 0 solved, 5336 unsolved
Search for dead transitions found 0 dead transitions in 120510ms
Starting structural reductions in LTL mode, iteration 1 : 766/775 places, 5337/5346 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124957 ms. Remains : 766/775 places, 5337/5346 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-07b-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 329 ms.
Product exploration explored 100000 steps with 33333 reset in 394 ms.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-07b-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-07b-LTLCardinality-13 finished in 125898 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((X(G(p1))||p0)))'
Support contains 4 out of 775 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 775/775 places, 5346/5346 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 765 transition count 5336
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 765 transition count 5336
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 763 transition count 5334
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 763 transition count 5334
Applied a total of 24 rules in 128 ms. Remains 763 /775 variables (removed 12) and now considering 5334/5346 (removed 12) transitions.
// Phase 1: matrix 5334 rows 763 cols
[2024-05-29 19:33:01] [INFO ] Computed 8 invariants in 73 ms
[2024-05-29 19:33:02] [INFO ] Implicit Places using invariants in 1337 ms returned []
[2024-05-29 19:33:02] [INFO ] Invariant cache hit.
[2024-05-29 19:33:05] [INFO ] Implicit Places using invariants and state equation in 2833 ms returned []
Implicit Place search using SMT with State Equation took 4173 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-05-29 19:33:05] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(timeout
s601 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 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 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 120423ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 120470ms
Starting structural reductions in LTL mode, iteration 1 : 763/775 places, 5334/5346 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124791 ms. Remains : 763/775 places, 5334/5346 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-07b-LTLCardinality-14
Product exploration explored 100000 steps with 823 reset in 410 ms.
Product exploration explored 100000 steps with 826 reset in 311 ms.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Detected a total of 105/763 stabilizing places and 112/5334 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 99 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (323 resets) in 165 ms. (240 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (45 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2024-05-29 19:35:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 213/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 548/763 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5334/6097 variables, 763/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6097/6097 variables, and 771 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 213/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 548/763 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:35:09] [INFO ] Deduced a trap composed of 164 places in 1516 ms of which 9 ms to minimize.
[2024-05-29 19:35:11] [INFO ] Deduced a trap composed of 169 places in 1554 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6097/6097 variables, and 773 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4695 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 6237ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Graph (trivial) has 778 edges and 763 vertex of which 111 / 763 are part of one of the 20 SCC in 1 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Graph (complete) has 1769 edges and 672 vertex of which 665 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 471 transitions
Trivial Post-agglo rules discarded 471 transitions
Performed 471 trivial Post agglomeration. Transition count delta: 471
Iterating post reduction 0 with 478 rules applied. Total rules applied 480 place count 665 transition count 4733
Reduce places removed 471 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 485 rules applied. Total rules applied 965 place count 194 transition count 4719
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 973 place count 187 transition count 4718
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 976 place count 186 transition count 4716
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 977 place count 185 transition count 4716
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 977 place count 185 transition count 4679
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1051 place count 148 transition count 4679
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1052 place count 148 transition count 4678
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 1124 place count 112 transition count 4642
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1136 place count 112 transition count 4630
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 1163 place count 85 transition count 486
Iterating global reduction 7 with 27 rules applied. Total rules applied 1190 place count 85 transition count 486
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1205 place count 85 transition count 471
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1210 place count 80 transition count 466
Iterating global reduction 8 with 5 rules applied. Total rules applied 1215 place count 80 transition count 466
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1233 place count 71 transition count 457
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
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 1239 place count 68 transition count 465
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 1249 place count 68 transition count 455
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1251 place count 67 transition count 461
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1259 place count 67 transition count 453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1261 place count 66 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1269 place count 66 transition count 451
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1271 place count 65 transition count 457
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1279 place count 65 transition count 449
Free-agglomeration rule applied 36 times.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1315 place count 65 transition count 413
Reduce places removed 36 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 8 with 69 rules applied. Total rules applied 1384 place count 29 transition count 380
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1391 place count 22 transition count 373
Iterating global reduction 9 with 7 rules applied. Total rules applied 1398 place count 22 transition count 373
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 9 with 95 rules applied. Total rules applied 1493 place count 22 transition count 278
Applied a total of 1493 rules in 456 ms. Remains 22 /763 variables (removed 741) and now considering 278/5334 (removed 5056) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 22/763 places, 278/5334 transitions.
RANDOM walk for 171 steps (0 resets) in 7 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 166 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Applied a total of 0 rules in 45 ms. Remains 763 /763 variables (removed 0) and now considering 5334/5334 (removed 0) transitions.
[2024-05-29 19:35:13] [INFO ] Invariant cache hit.
[2024-05-29 19:35:15] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2024-05-29 19:35:15] [INFO ] Invariant cache hit.
[2024-05-29 19:35:18] [INFO ] Implicit Places using invariants and state equation in 2907 ms returned []
Implicit Place search using SMT with State Equation took 4172 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-05-29 19:35:18] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 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 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 120878ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 120926ms
Finished structural reductions in LTL mode , in 1 iterations and 125163 ms. Remains : 763/763 places, 5334/5334 transitions.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Detected a total of 105/763 stabilizing places and 112/5334 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 89 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (325 resets) in 145 ms. (273 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (45 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-05-29 19:37:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 213/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 548/763 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5334/6097 variables, 763/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6097 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6097/6097 variables, and 771 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1484 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 213/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 548/763 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:37:22] [INFO ] Deduced a trap composed of 164 places in 1518 ms of which 3 ms to minimize.
[2024-05-29 19:37:24] [INFO ] Deduced a trap composed of 169 places in 1529 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6097/6097 variables, and 773 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4690 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 6192ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 141 ms.
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Graph (trivial) has 778 edges and 763 vertex of which 111 / 763 are part of one of the 20 SCC in 1 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Graph (complete) has 1769 edges and 672 vertex of which 665 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 471 transitions
Trivial Post-agglo rules discarded 471 transitions
Performed 471 trivial Post agglomeration. Transition count delta: 471
Iterating post reduction 0 with 478 rules applied. Total rules applied 480 place count 665 transition count 4733
Reduce places removed 471 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 485 rules applied. Total rules applied 965 place count 194 transition count 4719
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 973 place count 187 transition count 4718
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 976 place count 186 transition count 4716
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 977 place count 185 transition count 4716
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 977 place count 185 transition count 4679
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1051 place count 148 transition count 4679
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1052 place count 148 transition count 4678
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 1124 place count 112 transition count 4642
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1136 place count 112 transition count 4630
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 1163 place count 85 transition count 486
Iterating global reduction 7 with 27 rules applied. Total rules applied 1190 place count 85 transition count 486
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1205 place count 85 transition count 471
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1210 place count 80 transition count 466
Iterating global reduction 8 with 5 rules applied. Total rules applied 1215 place count 80 transition count 466
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1233 place count 71 transition count 457
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
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 1239 place count 68 transition count 465
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 1249 place count 68 transition count 455
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1251 place count 67 transition count 461
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1259 place count 67 transition count 453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1261 place count 66 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1269 place count 66 transition count 451
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1271 place count 65 transition count 457
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1279 place count 65 transition count 449
Free-agglomeration rule applied 36 times.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1315 place count 65 transition count 413
Reduce places removed 36 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 8 with 69 rules applied. Total rules applied 1384 place count 29 transition count 380
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1391 place count 22 transition count 373
Iterating global reduction 9 with 7 rules applied. Total rules applied 1398 place count 22 transition count 373
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 9 with 95 rules applied. Total rules applied 1493 place count 22 transition count 278
Applied a total of 1493 rules in 382 ms. Remains 22 /763 variables (removed 741) and now considering 278/5334 (removed 5056) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 22/763 places, 278/5334 transitions.
RANDOM walk for 221 steps (0 resets) in 10 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 142 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 822 reset in 303 ms.
Product exploration explored 100000 steps with 820 reset in 313 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 186 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Graph (trivial) has 774 edges and 763 vertex of which 111 / 763 are part of one of the 20 SCC in 0 ms
Free SCC test removed 91 places
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Performed 457 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 457 rules applied. Total rules applied 458 place count 672 transition count 5231
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 466 place count 672 transition count 5223
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 466 place count 672 transition count 5230
Deduced a syphon composed of 471 places in 2 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 480 place count 672 transition count 5230
Discarding 388 places :
Symmetric choice reduction at 2 with 388 rule applications. Total rules 868 place count 284 transition count 4842
Deduced a syphon composed of 89 places in 2 ms
Iterating global reduction 2 with 388 rules applied. Total rules applied 1256 place count 284 transition count 4842
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 147 places in 2 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 1314 place count 284 transition count 4842
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 1394 place count 204 transition count 640
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 2 with 80 rules applied. Total rules applied 1474 place count 204 transition count 640
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1489 place count 204 transition count 625
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1516 place count 177 transition count 593
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 1543 place count 177 transition count 593
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1548 place count 172 transition count 588
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 1553 place count 172 transition count 588
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1555 place count 172 transition count 590
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1557 place count 170 transition count 586
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1559 place count 170 transition count 586
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 1570 place count 170 transition count 634
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1586 place count 154 transition count 602
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 1602 place count 154 transition count 602
Deduced a syphon composed of 67 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 1624 place count 154 transition count 580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1625 place count 153 transition count 579
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1626 place count 153 transition count 579
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 1626 rules in 670 ms. Remains 153 /763 variables (removed 610) and now considering 579/5334 (removed 4755) transitions.
[2024-05-29 19:37:28] [INFO ] Redundant transitions in 3 ms returned []
Running 575 sub problems to find dead transitions.
[2024-05-29 19:37:28] [INFO ] Flow matrix only has 570 transitions (discarded 9 similar events)
// Phase 1: matrix 570 rows 153 cols
[2024-05-29 19:37:28] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 19:37:28] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2024-05-29 19:37:33] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-29 19:37:33] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2024-05-29 19:37:33] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2024-05-29 19:37:33] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 0 ms to minimize.
[2024-05-29 19:37:33] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-05-29 19:37:33] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2024-05-29 19:37:33] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2024-05-29 19:37:34] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2024-05-29 19:37:34] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2024-05-29 19:37:34] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2024-05-29 19:37:34] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2024-05-29 19:37:34] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:37:34] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2024-05-29 19:37:34] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2024-05-29 19:37:35] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2024-05-29 19:37:35] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2024-05-29 19:37:35] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2024-05-29 19:37:35] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2024-05-29 19:37:35] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2024-05-29 19:37:35] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/22 constraints. Problems are: Problem set: 10 solved, 565 unsolved
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 1 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 1 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2024-05-29 19:37:36] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2024-05-29 19:37:37] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2024-05-29 19:37:37] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:37:37] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2024-05-29 19:37:37] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2024-05-29 19:37:37] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:37:37] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:37:37] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 1 ms to minimize.
[2024-05-29 19:37:37] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2024-05-29 19:37:38] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2024-05-29 19:37:38] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:37:38] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2024-05-29 19:37:38] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2024-05-29 19:37:40] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 1 ms to minimize.
[2024-05-29 19:37:40] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 20/42 constraints. Problems are: Problem set: 10 solved, 565 unsolved
[2024-05-29 19:37:42] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2024-05-29 19:37:42] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2024-05-29 19:37:45] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2024-05-29 19:37:45] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2024-05-29 19:37:45] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 1 ms to minimize.
[2024-05-29 19:37:45] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2024-05-29 19:37:46] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 7/49 constraints. Problems are: Problem set: 10 solved, 565 unsolved
[2024-05-29 19:37:46] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/50 constraints. Problems are: Problem set: 10 solved, 565 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/50 constraints. Problems are: Problem set: 10 solved, 565 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
At refinement iteration 7 (OVERLAPS) 569/722 variables, 153/203 constraints. Problems are: Problem set: 92 solved, 483 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/722 variables, 133/336 constraints. Problems are: Problem set: 92 solved, 483 unsolved
[2024-05-29 19:37:56] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 1 ms to minimize.
[2024-05-29 19:37:56] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:37:56] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 1 ms to minimize.
[2024-05-29 19:37:56] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2024-05-29 19:37:57] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:37:57] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:37:57] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 1 ms to minimize.
[2024-05-29 19:37:57] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 1 ms to minimize.
[2024-05-29 19:37:57] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 1 ms to minimize.
[2024-05-29 19:37:57] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 722/723 variables, and 346 constraints, problems are : Problem set: 92 solved, 483 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 153/153 constraints, ReadFeed: 133/134 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 92 solved, 483 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 92 solved, 483 unsolved
At refinement iteration 1 (OVERLAPS) 67/153 variables, 2/2 constraints. Problems are: Problem set: 92 solved, 483 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 58/60 constraints. Problems are: Problem set: 92 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/60 constraints. Problems are: Problem set: 92 solved, 483 unsolved
At refinement iteration 4 (OVERLAPS) 569/722 variables, 153/213 constraints. Problems are: Problem set: 92 solved, 483 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/722 variables, 133/346 constraints. Problems are: Problem set: 92 solved, 483 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/722 variables, 483/829 constraints. Problems are: Problem set: 92 solved, 483 unsolved
[2024-05-29 19:38:25] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 1 ms to minimize.
[2024-05-29 19:38:25] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:38:28] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 0 ms to minimize.
[2024-05-29 19:38:28] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:38:29] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 0 ms to minimize.
SMT process timed out in 61771ms, After SMT, problems are : Problem set: 92 solved, 483 unsolved
Search for dead transitions found 92 dead transitions in 61778ms
Found 92 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 92 transitions
Dead transitions reduction (with SMT) removed 92 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 153/763 places, 487/5334 transitions.
Graph (complete) has 690 edges and 153 vertex of which 87 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.1 ms
Discarding 66 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 87 transition count 499
Deduced a syphon composed of 2 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 11 place count 87 transition count 491
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 87 transition count 499
Deduced a syphon composed of 3 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 20 place count 87 transition count 491
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 20 rules in 61 ms. Remains 87 /153 variables (removed 66) and now considering 491/487 (removed -4) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/763 places, 491/5334 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62527 ms. Remains : 87/763 places, 491/5334 transitions.
Built C files in :
/tmp/ltsmin10217478568738040731
[2024-05-29 19:38:30] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10217478568738040731
Running compilation step : cd /tmp/ltsmin10217478568738040731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10217478568738040731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10217478568738040731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 5334/5334 transitions.
Applied a total of 0 rules in 38 ms. Remains 763 /763 variables (removed 0) and now considering 5334/5334 (removed 0) transitions.
// Phase 1: matrix 5334 rows 763 cols
[2024-05-29 19:38:33] [INFO ] Computed 8 invariants in 76 ms
[2024-05-29 19:38:34] [INFO ] Implicit Places using invariants in 1323 ms returned []
[2024-05-29 19:38:34] [INFO ] Invariant cache hit.
[2024-05-29 19:38:37] [INFO ] Implicit Places using invariants and state equation in 2833 ms returned []
Implicit Place search using SMT with State Equation took 4158 ms to find 0 implicit places.
Running 5333 sub problems to find dead transitions.
[2024-05-29 19:38:37] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 5333/945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5333 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/6097 variables, and 0 constraints, problems are : Problem set: 0 solved, 5333 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 4388/945 constraints, Known Traps: 0/0 constraints]
After SMT, in 120277ms problems are : Problem set: 0 solved, 5333 unsolved
Search for dead transitions found 0 dead transitions in 120324ms
Finished structural reductions in LTL mode , in 1 iterations and 124542 ms. Remains : 763/763 places, 5334/5334 transitions.
Built C files in :
/tmp/ltsmin14774267514925796295
[2024-05-29 19:40:37] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14774267514925796295
Running compilation step : cd /tmp/ltsmin14774267514925796295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14774267514925796295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14774267514925796295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 19:40:41] [INFO ] Flatten gal took : 339 ms
[2024-05-29 19:40:41] [INFO ] Flatten gal took : 328 ms
[2024-05-29 19:40:41] [INFO ] Time to serialize gal into /tmp/LTL3943328899425148658.gal : 88 ms
[2024-05-29 19:40:41] [INFO ] Time to serialize properties into /tmp/LTL3663190070690473188.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3943328899425148658.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12447744493735350631.hoa' '-atoms' '/tmp/LTL3663190070690473188.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3663190070690473188.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12447744493735350631.hoa
Detected timeout of ITS tools.
[2024-05-29 19:40:57] [INFO ] Flatten gal took : 315 ms
[2024-05-29 19:40:57] [INFO ] Flatten gal took : 317 ms
[2024-05-29 19:40:57] [INFO ] Time to serialize gal into /tmp/LTL6038057059457082961.gal : 58 ms
[2024-05-29 19:40:57] [INFO ] Time to serialize properties into /tmp/LTL13166309892447284770.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6038057059457082961.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13166309892447284770.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((p830==0)||(p744==1))")||(X(G("((p816!=0)&&(p808!=1))"))))))
Formula 0 simplified : F(!"((p830==0)||(p744==1))" & XF!"((p816!=0)&&(p808!=1))")
Detected timeout of ITS tools.
[2024-05-29 19:41:13] [INFO ] Flatten gal took : 315 ms
[2024-05-29 19:41:13] [INFO ] Applying decomposition
[2024-05-29 19:41:13] [INFO ] Flatten gal took : 318 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1007607853804108624.txt' '-o' '/tmp/graph1007607853804108624.bin' '-w' '/tmp/graph1007607853804108624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1007607853804108624.bin' '-l' '-1' '-v' '-w' '/tmp/graph1007607853804108624.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:41:14] [INFO ] Decomposing Gal with order
[2024-05-29 19:41:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:41:15] [INFO ] Removed a total of 31626 redundant transitions.
[2024-05-29 19:41:15] [INFO ] Flatten gal took : 578 ms
[2024-05-29 19:41:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 243 ms.
[2024-05-29 19:41:15] [INFO ] Time to serialize gal into /tmp/LTL15967324034047641198.gal : 40 ms
[2024-05-29 19:41:15] [INFO ] Time to serialize properties into /tmp/LTL17135192614417520164.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15967324034047641198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17135192614417520164.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(("((i42.i0.i0.u270.p830==0)||(i36.u243.p744==1))")||(X(G("((i7.i5.i1.u221.p816!=0)&&(i7.i5.i0.u262.p808!=1))"))))))
Formula 0 simplified : F(!"((i42.i0.i0.u270.p830==0)||(i36.u243.p744==1))" & XF!"((i7.i5.i1.u221.p816!=0)&&(i7.i5.i0.u262.p808!=1))")
Detected timeout of ITS tools.
Treatment of property StigmergyElection-PT-07b-LTLCardinality-14 finished in 510108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&G((p2||X(p3)))))))'
Support contains 7 out of 775 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 775/775 places, 5346/5346 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 768 transition count 5339
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 768 transition count 5339
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 766 transition count 5337
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 766 transition count 5337
Applied a total of 18 rules in 115 ms. Remains 766 /775 variables (removed 9) and now considering 5337/5346 (removed 9) transitions.
// Phase 1: matrix 5337 rows 766 cols
[2024-05-29 19:41:31] [INFO ] Computed 8 invariants in 64 ms
[2024-05-29 19:41:32] [INFO ] Implicit Places using invariants in 1272 ms returned []
[2024-05-29 19:41:32] [INFO ] Invariant cache hit.
[2024-05-29 19:41:35] [INFO ] Implicit Places using invariants and state equation in 2749 ms returned []
Implicit Place search using SMT with State Equation took 4032 ms to find 0 implicit places.
Running 5336 sub problems to find dead transitions.
[2024-05-29 19:41:35] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 timeout
1.0)
(s641 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/6103 variables, and 0 constraints, problems are : Problem set: 0 solved, 5336 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/766 constraints, PredecessorRefiner: 5336/948 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5336 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/6103 variables, and 0 constraints, problems are : Problem set: 0 solved, 5336 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/766 constraints, PredecessorRefiner: 4388/948 constraints, Known Traps: 0/0 constraints]
After SMT, in 120129ms problems are : Problem set: 0 solved, 5336 unsolved
Search for dead transitions found 0 dead transitions in 120176ms
Starting structural reductions in LTL mode, iteration 1 : 766/775 places, 5337/5346 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124335 ms. Remains : 766/775 places, 5337/5346 transitions.
Stuttering acceptance computed with spot in 313 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-07b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07b-LTLCardinality-15 finished in 124684 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)))'
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((X(G(p1))||p0)))'
Found a Lengthening insensitive property : StigmergyElection-PT-07b-LTLCardinality-14
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 775 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 775/775 places, 5346/5346 transitions.
Graph (trivial) has 786 edges and 775 vertex of which 112 / 775 are part of one of the 20 SCC in 1 ms
Free SCC test removed 92 places
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 465 transitions
Trivial Post-agglo rules discarded 465 transitions
Performed 465 trivial Post agglomeration. Transition count delta: 465
Iterating post reduction 0 with 465 rules applied. Total rules applied 466 place count 682 transition count 4776
Reduce places removed 465 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 479 rules applied. Total rules applied 945 place count 217 transition count 4762
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 955 place count 210 transition count 4759
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 960 place count 207 transition count 4757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 961 place count 206 transition count 4757
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 27 Pre rules applied. Total rules applied 961 place count 206 transition count 4730
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 1015 place count 179 transition count 4730
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1024 place count 170 transition count 4720
Iterating global reduction 5 with 9 rules applied. Total rules applied 1033 place count 170 transition count 4720
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1033 place count 170 transition count 4718
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1037 place count 168 transition count 4718
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1039 place count 166 transition count 3987
Iterating global reduction 5 with 2 rules applied. Total rules applied 1041 place count 166 transition count 3987
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1042 place count 166 transition count 3986
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1043 place count 165 transition count 3984
Iterating global reduction 6 with 1 rules applied. Total rules applied 1044 place count 165 transition count 3984
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 1110 place count 132 transition count 3951
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1134 place count 108 transition count 547
Iterating global reduction 6 with 24 rules applied. Total rules applied 1158 place count 108 transition count 547
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1171 place count 108 transition count 534
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1175 place count 104 transition count 526
Iterating global reduction 7 with 4 rules applied. Total rules applied 1179 place count 104 transition count 526
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1183 place count 100 transition count 518
Iterating global reduction 7 with 4 rules applied. Total rules applied 1187 place count 100 transition count 518
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1213 place count 87 transition count 525
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1214 place count 86 transition count 507
Iterating global reduction 7 with 1 rules applied. Total rules applied 1215 place count 86 transition count 507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1216 place count 86 transition count 506
Applied a total of 1216 rules in 383 ms. Remains 86 /775 variables (removed 689) and now considering 506/5346 (removed 4840) transitions.
[2024-05-29 19:43:36] [INFO ] Flow matrix only has 497 transitions (discarded 9 similar events)
// Phase 1: matrix 497 rows 86 cols
[2024-05-29 19:43:36] [INFO ] Computed 2 invariants in 10 ms
[2024-05-29 19:43:36] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-29 19:43:36] [INFO ] Flow matrix only has 497 transitions (discarded 9 similar events)
[2024-05-29 19:43:36] [INFO ] Invariant cache hit.
[2024-05-29 19:43:36] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 19:43:36] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 489 sub problems to find dead transitions.
[2024-05-29 19:43:36] [INFO ] Flow matrix only has 497 transitions (discarded 9 similar events)
[2024-05-29 19:43:36] [INFO ] Invariant cache hit.
[2024-05-29 19:43:36] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:43:40] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2024-05-29 19:43:40] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2024-05-29 19:43:40] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 0 ms to minimize.
[2024-05-29 19:43:40] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 1 ms to minimize.
[2024-05-29 19:43:40] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2024-05-29 19:43:40] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2024-05-29 19:43:41] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 1 ms to minimize.
[2024-05-29 19:43:41] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2024-05-29 19:43:41] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-05-29 19:43:41] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2024-05-29 19:43:41] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:43:41] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2024-05-29 19:43:41] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2024-05-29 19:43:42] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2024-05-29 19:43:42] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 0 ms to minimize.
[2024-05-29 19:43:42] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 0 ms to minimize.
[2024-05-29 19:43:43] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:43:43] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2024-05-29 19:43:43] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 0 ms to minimize.
[2024-05-29 19:43:43] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:43:44] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 1 ms to minimize.
[2024-05-29 19:43:44] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 1 ms to minimize.
[2024-05-29 19:43:44] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 1 ms to minimize.
[2024-05-29 19:43:44] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2024-05-29 19:43:45] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 1 ms to minimize.
[2024-05-29 19:43:45] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 1 ms to minimize.
[2024-05-29 19:43:45] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 1 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 0 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 0 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:43:48] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 1 ms to minimize.
[2024-05-29 19:43:48] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2024-05-29 19:43:48] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2024-05-29 19:43:48] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:43:49] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 1 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 1 ms to minimize.
[2024-05-29 19:43:52] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 8 (OVERLAPS) 496/582 variables, 86/135 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 126/261 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:44:06] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2024-05-29 19:44:06] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 0 ms to minimize.
[2024-05-29 19:44:06] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:44:06] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/583 variables, and 265 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 489 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:44:11] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:44:11] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:44:14] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2024-05-29 19:44:14] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:44:16] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 9 (OVERLAPS) 496/582 variables, 86/144 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 126/270 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 489/759 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/583 variables, and 759 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 56/56 constraints]
After SMT, in 61538ms problems are : Problem set: 0 solved, 489 unsolved
Search for dead transitions found 0 dead transitions in 61544ms
Starting structural reductions in LI_LTL mode, iteration 1 : 86/775 places, 506/5346 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62409 ms. Remains : 86/775 places, 506/5346 transitions.
Running random walk in product with property : StigmergyElection-PT-07b-LTLCardinality-14
Product exploration explored 100000 steps with 7117 reset in 218 ms.
Product exploration explored 100000 steps with 7107 reset in 225 ms.
Computed a total of 7 stabilizing places and 25 stable transitions
Computed a total of 7 stabilizing places and 25 stable transitions
Detected a total of 7/86 stabilizing places and 25/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (2850 resets) in 115 ms. (344 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (282 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2024-05-29 19:44:39] [INFO ] Flow matrix only has 497 transitions (discarded 9 similar events)
[2024-05-29 19:44:39] [INFO ] Invariant cache hit.
[2024-05-29 19:44:39] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 495/579 variables, 84/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 126/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/582 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/583 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/583 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:44:39] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 0 ms to minimize.
[2024-05-29 19:44:39] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 0 ms to minimize.
[2024-05-29 19:44:39] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2024-05-29 19:44:39] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:44:39] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 495/579 variables, 84/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 126/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:44:40] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/582 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/583 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/583 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/583 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 583/583 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1218ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2641 steps, including 172 resets, run visited all 1 properties in 8 ms. (steps per millisecond=330 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 506/506 transitions.
Applied a total of 0 rules in 7 ms. Remains 86 /86 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-29 19:44:40] [INFO ] Flow matrix only has 497 transitions (discarded 9 similar events)
[2024-05-29 19:44:40] [INFO ] Invariant cache hit.
[2024-05-29 19:44:40] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-29 19:44:40] [INFO ] Flow matrix only has 497 transitions (discarded 9 similar events)
[2024-05-29 19:44:40] [INFO ] Invariant cache hit.
[2024-05-29 19:44:40] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 19:44:41] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 489 sub problems to find dead transitions.
[2024-05-29 19:44:41] [INFO ] Flow matrix only has 497 transitions (discarded 9 similar events)
[2024-05-29 19:44:41] [INFO ] Invariant cache hit.
[2024-05-29 19:44:41] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:44:44] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2024-05-29 19:44:44] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2024-05-29 19:44:45] [INFO ] Deduced a trap composed of 25 places in 308 ms of which 1 ms to minimize.
[2024-05-29 19:44:45] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 1 ms to minimize.
[2024-05-29 19:44:45] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2024-05-29 19:44:45] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-05-29 19:44:45] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 0 ms to minimize.
[2024-05-29 19:44:45] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2024-05-29 19:44:45] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2024-05-29 19:44:45] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:44:46] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2024-05-29 19:44:46] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2024-05-29 19:44:46] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 0 ms to minimize.
[2024-05-29 19:44:48] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:44:49] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 0 ms to minimize.
[2024-05-29 19:44:49] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 1 ms to minimize.
[2024-05-29 19:44:49] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 1 ms to minimize.
[2024-05-29 19:44:49] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2024-05-29 19:44:49] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:44:49] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 0 ms to minimize.
[2024-05-29 19:44:49] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2024-05-29 19:44:50] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2024-05-29 19:44:51] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 0 ms to minimize.
[2024-05-29 19:44:51] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2024-05-29 19:44:51] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:44:51] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2024-05-29 19:44:52] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 0 ms to minimize.
[2024-05-29 19:44:52] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2024-05-29 19:44:52] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:44:52] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 0 ms to minimize.
[2024-05-29 19:44:52] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 0 ms to minimize.
[2024-05-29 19:44:52] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 0 ms to minimize.
[2024-05-29 19:44:52] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2024-05-29 19:44:53] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:44:54] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2024-05-29 19:44:54] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2024-05-29 19:44:54] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:44:54] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 1 ms to minimize.
[2024-05-29 19:44:55] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:44:55] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 1 ms to minimize.
[2024-05-29 19:44:56] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 8 (OVERLAPS) 496/582 variables, 86/135 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 126/261 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:45:11] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:45:11] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:45:11] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:45:12] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/583 variables, and 265 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 489 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:45:15] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:45:15] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:45:18] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2024-05-29 19:45:18] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:45:20] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 9 (OVERLAPS) 496/582 variables, 86/144 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 126/270 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 489/759 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/583 variables, and 759 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 56/56 constraints]
After SMT, in 61544ms problems are : Problem set: 0 solved, 489 unsolved
Search for dead transitions found 0 dead transitions in 61554ms
Finished structural reductions in LTL mode , in 1 iterations and 62021 ms. Remains : 86/86 places, 506/506 transitions.
Computed a total of 7 stabilizing places and 25 stable transitions
Computed a total of 7 stabilizing places and 25 stable transitions
Detected a total of 7/86 stabilizing places and 25/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (2855 resets) in 125 ms. (317 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (273 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
[2024-05-29 19:45:43] [INFO ] Flow matrix only has 497 transitions (discarded 9 similar events)
[2024-05-29 19:45:43] [INFO ] Invariant cache hit.
[2024-05-29 19:45:43] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 495/579 variables, 84/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 126/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/582 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/583 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/583 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:45:43] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2024-05-29 19:45:43] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2024-05-29 19:45:43] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:45:43] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2024-05-29 19:45:43] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 495/579 variables, 84/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 126/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:45:44] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/582 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/583 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/583 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/583 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 583/583 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1042 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1266ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2113 steps, including 139 resets, run visited all 1 properties in 9 ms. (steps per millisecond=234 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 253 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 7115 reset in 237 ms.
Product exploration explored 100000 steps with 7108 reset in 236 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 506/506 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 86 transition count 497
Applied a total of 9 rules in 27 ms. Remains 86 /86 variables (removed 0) and now considering 497/506 (removed 9) transitions.
[2024-05-29 19:45:45] [INFO ] Redundant transitions in 3 ms returned []
Running 480 sub problems to find dead transitions.
[2024-05-29 19:45:45] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
// Phase 1: matrix 488 rows 86 cols
[2024-05-29 19:45:45] [INFO ] Computed 2 invariants in 7 ms
[2024-05-29 19:45:45] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:45:49] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 0 ms to minimize.
[2024-05-29 19:45:49] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2024-05-29 19:45:49] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 1 ms to minimize.
[2024-05-29 19:45:49] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 1 ms to minimize.
[2024-05-29 19:45:49] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 1 ms to minimize.
[2024-05-29 19:45:50] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 0 ms to minimize.
[2024-05-29 19:45:50] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 0 ms to minimize.
[2024-05-29 19:45:50] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2024-05-29 19:45:50] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2024-05-29 19:45:50] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 0 ms to minimize.
[2024-05-29 19:45:50] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2024-05-29 19:45:51] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 0 ms to minimize.
[2024-05-29 19:45:51] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2024-05-29 19:45:52] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:45:52] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:45:52] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:45:52] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:45:52] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2024-05-29 19:45:52] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2024-05-29 19:45:52] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:45:53] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 1 ms to minimize.
[2024-05-29 19:45:54] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:45:54] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
[2024-05-29 19:45:54] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 0 ms to minimize.
[2024-05-29 19:45:54] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:45:54] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2024-05-29 19:45:54] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 1 ms to minimize.
[2024-05-29 19:45:54] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 0 ms to minimize.
[2024-05-29 19:45:55] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 1 ms to minimize.
[2024-05-29 19:45:55] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 0 ms to minimize.
[2024-05-29 19:45:55] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:45:55] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:45:55] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2024-05-29 19:45:56] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2024-05-29 19:45:56] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2024-05-29 19:45:56] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 0 ms to minimize.
[2024-05-29 19:45:56] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 0 ms to minimize.
[2024-05-29 19:45:57] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2024-05-29 19:45:57] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 0 ms to minimize.
[2024-05-29 19:45:57] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:45:59] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 1 ms to minimize.
[2024-05-29 19:45:59] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 1 ms to minimize.
[2024-05-29 19:45:59] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 1 ms to minimize.
[2024-05-29 19:45:59] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2024-05-29 19:46:00] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 1 ms to minimize.
[2024-05-29 19:46:00] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 0 ms to minimize.
[2024-05-29 19:46:00] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:46:00] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:46:00] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (OVERLAPS) 487/573 variables, 86/137 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 126/263 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:46:09] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/574 variables, and 264 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:46:20] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-29 19:46:20] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 0 ms to minimize.
[2024-05-29 19:46:20] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 0 ms to minimize.
[2024-05-29 19:46:20] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2024-05-29 19:46:22] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
[2024-05-29 19:46:22] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:46:22] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2024-05-29 19:46:22] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (OVERLAPS) 487/573 variables, 86/146 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 126/272 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 480/752 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/574 variables, and 752 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 58/58 constraints]
After SMT, in 61814ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 61818ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/86 places, 497/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61860 ms. Remains : 86/86 places, 497/506 transitions.
Built C files in :
/tmp/ltsmin17388649025098042106
[2024-05-29 19:46:47] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17388649025098042106
Running compilation step : cd /tmp/ltsmin17388649025098042106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1403 ms.
Running link step : cd /tmp/ltsmin17388649025098042106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17388649025098042106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3806796856423598539.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 506/506 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-29 19:47:02] [INFO ] Flow matrix only has 497 transitions (discarded 9 similar events)
// Phase 1: matrix 497 rows 86 cols
[2024-05-29 19:47:02] [INFO ] Computed 2 invariants in 7 ms
[2024-05-29 19:47:02] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-29 19:47:02] [INFO ] Flow matrix only has 497 transitions (discarded 9 similar events)
[2024-05-29 19:47:02] [INFO ] Invariant cache hit.
[2024-05-29 19:47:02] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 19:47:02] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 489 sub problems to find dead transitions.
[2024-05-29 19:47:02] [INFO ] Flow matrix only has 497 transitions (discarded 9 similar events)
[2024-05-29 19:47:02] [INFO ] Invariant cache hit.
[2024-05-29 19:47:02] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:47:06] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2024-05-29 19:47:06] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:47:06] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 0 ms to minimize.
[2024-05-29 19:47:07] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 1 ms to minimize.
[2024-05-29 19:47:07] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 1 ms to minimize.
[2024-05-29 19:47:07] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 0 ms to minimize.
[2024-05-29 19:47:07] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2024-05-29 19:47:07] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-05-29 19:47:07] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2024-05-29 19:47:07] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:47:08] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2024-05-29 19:47:08] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2024-05-29 19:47:08] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 0 ms to minimize.
[2024-05-29 19:47:09] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2024-05-29 19:47:09] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 0 ms to minimize.
[2024-05-29 19:47:09] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2024-05-29 19:47:09] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 1 ms to minimize.
[2024-05-29 19:47:09] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 1 ms to minimize.
[2024-05-29 19:47:09] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:47:10] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:47:11] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 1 ms to minimize.
[2024-05-29 19:47:11] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 1 ms to minimize.
[2024-05-29 19:47:11] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2024-05-29 19:47:11] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2024-05-29 19:47:11] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 0 ms to minimize.
[2024-05-29 19:47:11] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2024-05-29 19:47:11] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 1 ms to minimize.
[2024-05-29 19:47:12] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 1 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 0 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2024-05-29 19:47:14] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 0 ms to minimize.
[2024-05-29 19:47:14] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 0 ms to minimize.
[2024-05-29 19:47:14] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 0 ms to minimize.
[2024-05-29 19:47:14] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2024-05-29 19:47:14] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 0 ms to minimize.
[2024-05-29 19:47:14] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:47:15] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 0 ms to minimize.
[2024-05-29 19:47:16] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2024-05-29 19:47:16] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2024-05-29 19:47:16] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:47:16] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:47:17] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2024-05-29 19:47:18] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 8 (OVERLAPS) 496/582 variables, 86/135 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 126/261 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:47:31] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/583 variables, and 265 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 489 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:47:37] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:47:37] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:47:40] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2024-05-29 19:47:40] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-29 19:47:43] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 9 (OVERLAPS) 496/582 variables, 86/144 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 126/270 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 489/759 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/583 variables, and 759 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 56/56 constraints]
After SMT, in 61822ms problems are : Problem set: 0 solved, 489 unsolved
Search for dead transitions found 0 dead transitions in 61831ms
Finished structural reductions in LTL mode , in 1 iterations and 62292 ms. Remains : 86/86 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin16709341634547767509
[2024-05-29 19:48:04] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16709341634547767509
Running compilation step : cd /tmp/ltsmin16709341634547767509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1340 ms.
Running link step : cd /tmp/ltsmin16709341634547767509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16709341634547767509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10502707381809332318.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 19:48:20] [INFO ] Flatten gal took : 43 ms
[2024-05-29 19:48:20] [INFO ] Flatten gal took : 34 ms
[2024-05-29 19:48:20] [INFO ] Time to serialize gal into /tmp/LTL94080159632738167.gal : 8 ms
[2024-05-29 19:48:20] [INFO ] Time to serialize properties into /tmp/LTL15380933212080224080.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL94080159632738167.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13108551520553056099.hoa' '-atoms' '/tmp/LTL15380933212080224080.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL15380933212080224080.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13108551520553056099.hoa
Detected timeout of ITS tools.
[2024-05-29 19:48:35] [INFO ] Flatten gal took : 33 ms
[2024-05-29 19:48:35] [INFO ] Flatten gal took : 47 ms
[2024-05-29 19:48:35] [INFO ] Time to serialize gal into /tmp/LTL16937412080163164689.gal : 5 ms
[2024-05-29 19:48:35] [INFO ] Time to serialize properties into /tmp/LTL466335515584642661.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16937412080163164689.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL466335515584642661.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("((p830==0)||(p744==1))")||(X(G("((p816!=0)&&(p808!=1))"))))))
Formula 0 simplified : F(!"((p830==0)||(p744==1))" & XF!"((p816!=0)&&(p808!=1))")
Detected timeout of ITS tools.
[2024-05-29 19:48:50] [INFO ] Flatten gal took : 34 ms
[2024-05-29 19:48:50] [INFO ] Applying decomposition
[2024-05-29 19:48:50] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14432870681324171795.txt' '-o' '/tmp/graph14432870681324171795.bin' '-w' '/tmp/graph14432870681324171795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14432870681324171795.bin' '-l' '-1' '-v' '-w' '/tmp/graph14432870681324171795.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:48:50] [INFO ] Decomposing Gal with order
[2024-05-29 19:48:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:48:50] [INFO ] Removed a total of 2749 redundant transitions.
[2024-05-29 19:48:50] [INFO ] Flatten gal took : 50 ms
[2024-05-29 19:48:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 8 ms.
[2024-05-29 19:48:50] [INFO ] Time to serialize gal into /tmp/LTL8160386282442035765.gal : 2 ms
[2024-05-29 19:48:50] [INFO ] Time to serialize properties into /tmp/LTL16566629608953923657.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8160386282442035765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16566629608953923657.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((i7.u23.p830==0)||(i6.u18.p744==1))")||(X(G("((i6.u22.p816!=0)&&(i6.u21.p808!=1))"))))))
Formula 0 simplified : F(!"((i7.u23.p830==0)||(i6.u18.p744==1))" & XF!"((i6.u22.p816!=0)&&(i6.u21.p808!=1))")
Detected timeout of ITS tools.
Treatment of property StigmergyElection-PT-07b-LTLCardinality-14 finished in 330183 ms.
[2024-05-29 19:49:06] [INFO ] Flatten gal took : 308 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin549084105366780615
[2024-05-29 19:49:06] [INFO ] Too many transitions (5346) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:49:06] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin549084105366780615
Running compilation step : cd /tmp/ltsmin549084105366780615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 19:49:06] [INFO ] Applying decomposition
[2024-05-29 19:49:07] [INFO ] Flatten gal took : 404 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7686080106381051028.txt' '-o' '/tmp/graph7686080106381051028.bin' '-w' '/tmp/graph7686080106381051028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7686080106381051028.bin' '-l' '-1' '-v' '-w' '/tmp/graph7686080106381051028.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:49:07] [INFO ] Decomposing Gal with order
[2024-05-29 19:49:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:49:08] [INFO ] Removed a total of 31624 redundant transitions.
[2024-05-29 19:49:08] [INFO ] Flatten gal took : 562 ms
[2024-05-29 19:49:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 128 ms.
[2024-05-29 19:49:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality6772209362461311340.gal : 137 ms
[2024-05-29 19:49:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality5247234489039635377.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6772209362461311340.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5247234489039635377.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F(G("((i42.u219.p652!=1)||((i24.u167.p495!=0)&&(i25.u144.p423!=1)))"))))
Formula 0 simplified : GF!"((i42.u219.p652!=1)||((i24.u167.p495!=0)&&(i25.u144.p423!=1)))"
Compilation finished in 29942 ms.
Running link step : cd /tmp/ltsmin549084105366780615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin549084105366780615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t83, t162, t164, t181, t227, t228, t262, t264, t281, t328, t362, t381, t461, t463, t480, t560...659
Computing Next relation with stutter on 6.73277e+06 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin549084105366780615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin549084105366780615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X([]((LTLAPp2==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="StigmergyElection-PT-07b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is StigmergyElection-PT-07b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532100339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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