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.r536-tall-171690532000284.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is StigmergyElection-PT-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532000284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 18:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 11 18:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 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 71K 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-04a-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-04a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717245364104

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-04a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:36:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:36:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:36:05] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-06-01 12:36:05] [INFO ] Transformed 58 places.
[2024-06-01 12:36:05] [INFO ] Transformed 218 transitions.
[2024-06-01 12:36:05] [INFO ] Found NUPN structural information;
[2024-06-01 12:36:05] [INFO ] Parsed PT model containing 58 places and 218 transitions and 1238 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 110 transitions
Reduce redundant transitions removed 110 transitions.
FORMULA StigmergyElection-PT-04a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 108/108 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 53 transition count 100
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 53 transition count 100
Applied a total of 10 rules in 19 ms. Remains 53 /58 variables (removed 5) and now considering 100/108 (removed 8) transitions.
[2024-06-01 12:36:05] [INFO ] Flow matrix only has 93 transitions (discarded 7 similar events)
// Phase 1: matrix 93 rows 53 cols
[2024-06-01 12:36:05] [INFO ] Computed 3 invariants in 11 ms
[2024-06-01 12:36:05] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-06-01 12:36:05] [INFO ] Flow matrix only has 93 transitions (discarded 7 similar events)
[2024-06-01 12:36:05] [INFO ] Invariant cache hit.
[2024-06-01 12:36:05] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:36:05] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2024-06-01 12:36:05] [INFO ] Flow matrix only has 93 transitions (discarded 7 similar events)
[2024-06-01 12:36:05] [INFO ] Invariant cache hit.
[2024-06-01 12:36:05] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 19 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
[2024-06-01 12:36:07] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:36:07] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:36:07] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:36:07] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:36:07] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:36:07] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:36:07] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:36:07] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:36:07] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:36:07] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:36:07] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:36:07] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:36:07] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:36:08] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-01 12:36:08] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 92/145 variables, 53/88 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 48/136 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 1/146 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (OVERLAPS) 0/146 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 137 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 53/53 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 92/145 variables, 53/88 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 48/136 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 99/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 1/146 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/146 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 236 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2710 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 53/53 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 32/32 constraints]
After SMT, in 6834ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 6846ms
Starting structural reductions in LTL mode, iteration 1 : 53/58 places, 100/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7212 ms. Remains : 53/58 places, 100/108 transitions.
Support contains 14 out of 53 places after structural reductions.
[2024-06-01 12:36:12] [INFO ] Flatten gal took : 29 ms
[2024-06-01 12:36:12] [INFO ] Flatten gal took : 10 ms
[2024-06-01 12:36:12] [INFO ] Input system was already deterministic with 100 transitions.
RANDOM walk for 3482 steps (16 resets) in 84 ms. (40 steps per ms) remains 0/12 properties
Computed a total of 10 stabilizing places and 9 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' '!(G((X(F(p0))||(F(p1)&&X(X(X(p2)))))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 100/100 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 49 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 49 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 48 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 48 transition count 91
Applied a total of 10 rules in 3 ms. Remains 48 /53 variables (removed 5) and now considering 91/100 (removed 9) transitions.
[2024-06-01 12:36:13] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
// Phase 1: matrix 86 rows 48 cols
[2024-06-01 12:36:13] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:36:13] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 12:36:13] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2024-06-01 12:36:13] [INFO ] Invariant cache hit.
[2024-06-01 12:36:13] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:36:13] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/53 places, 91/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 40 transition count 84
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 40 transition count 84
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 36 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 36 transition count 80
Applied a total of 22 rules in 3 ms. Remains 36 /47 variables (removed 11) and now considering 80/91 (removed 11) transitions.
[2024-06-01 12:36:13] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
// Phase 1: matrix 75 rows 36 cols
[2024-06-01 12:36:13] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:36:13] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 12:36:13] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
[2024-06-01 12:36:13] [INFO ] Invariant cache hit.
[2024-06-01 12:36:13] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 12:36:13] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 36/53 places, 80/100 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 36/53 places, 80/100 transitions.
Stuttering acceptance computed with spot in 343 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04a-LTLFireability-02
Stuttering criterion allowed to conclude after 1155 steps with 375 reset in 11 ms.
FORMULA StigmergyElection-PT-04a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04a-LTLFireability-02 finished in 578 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||X(!p0))))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 100/100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 48 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 48 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 47 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 47 transition count 89
Applied a total of 12 rules in 3 ms. Remains 47 /53 variables (removed 6) and now considering 89/100 (removed 11) transitions.
[2024-06-01 12:36:13] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
// Phase 1: matrix 84 rows 47 cols
[2024-06-01 12:36:13] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:36:13] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 12:36:13] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
[2024-06-01 12:36:13] [INFO ] Invariant cache hit.
[2024-06-01 12:36:13] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:36:13] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 89/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 38 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 38 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 34 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 34 transition count 77
Applied a total of 24 rules in 4 ms. Remains 34 /46 variables (removed 12) and now considering 77/89 (removed 12) transitions.
[2024-06-01 12:36:13] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
// Phase 1: matrix 72 rows 34 cols
[2024-06-01 12:36:13] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:36:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 12:36:13] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2024-06-01 12:36:13] [INFO ] Invariant cache hit.
[2024-06-01 12:36:14] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 12:36:14] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 34/53 places, 77/100 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 168 ms. Remains : 34/53 places, 77/100 transitions.
Stuttering acceptance computed with spot in 88 ms :[p0, true, p0, p0]
Running random walk in product with property : StigmergyElection-PT-04a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04a-LTLFireability-04 finished in 269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 100/100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 48 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 48 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 47 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 47 transition count 89
Applied a total of 12 rules in 4 ms. Remains 47 /53 variables (removed 6) and now considering 89/100 (removed 11) transitions.
[2024-06-01 12:36:14] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
// Phase 1: matrix 84 rows 47 cols
[2024-06-01 12:36:14] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 12:36:14] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 12:36:14] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
[2024-06-01 12:36:14] [INFO ] Invariant cache hit.
[2024-06-01 12:36:14] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:36:14] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 89/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 38 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 38 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 35 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 35 transition count 78
Applied a total of 22 rules in 2 ms. Remains 35 /46 variables (removed 11) and now considering 78/89 (removed 11) transitions.
[2024-06-01 12:36:14] [INFO ] Flow matrix only has 73 transitions (discarded 5 similar events)
// Phase 1: matrix 73 rows 35 cols
[2024-06-01 12:36:14] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 12:36:14] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 12:36:14] [INFO ] Flow matrix only has 73 transitions (discarded 5 similar events)
[2024-06-01 12:36:14] [INFO ] Invariant cache hit.
[2024-06-01 12:36:14] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 12:36:14] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 35/53 places, 78/100 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 168 ms. Remains : 35/53 places, 78/100 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04a-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04a-LTLFireability-05 finished in 261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 51 transition count 84
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 36 transition count 84
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 31 place count 36 transition count 77
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 45 place count 29 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 26 transition count 72
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 26 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 26 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 25 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 25 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 25 transition count 67
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 64 place count 21 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 68 place count 21 transition count 59
Performed 3 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 74 place count 18 transition count 75
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 96 place count 18 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 98 place count 17 transition count 65
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 112 place count 17 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 128 place count 17 transition count 35
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 132 place count 13 transition count 31
Applied a total of 132 rules in 31 ms. Remains 13 /53 variables (removed 40) and now considering 31/100 (removed 69) transitions.
[2024-06-01 12:36:14] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 13 cols
[2024-06-01 12:36:14] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:36:14] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 12:36:14] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2024-06-01 12:36:14] [INFO ] Invariant cache hit.
[2024-06-01 12:36:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 12:36:14] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-01 12:36:14] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-06-01 12:36:14] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2024-06-01 12:36:14] [INFO ] Invariant cache hit.
[2024-06-01 12:36:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 4/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 5 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 2 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 26/39 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/40 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 12:36:14] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/40 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 31 constraints, problems are : Problem set: 0 solved, 13 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 4/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 26/39 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/40 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 12:36:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/40 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 45 constraints, problems are : Problem set: 0 solved, 13 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 17/17 constraints]
After SMT, in 738ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 742ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/53 places, 31/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 831 ms. Remains : 13/53 places, 31/100 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04a-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04a-LTLFireability-06 finished in 887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(X(X(!p1)))))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 100/100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 48 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 48 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 47 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 47 transition count 89
Applied a total of 12 rules in 3 ms. Remains 47 /53 variables (removed 6) and now considering 89/100 (removed 11) transitions.
[2024-06-01 12:36:15] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
// Phase 1: matrix 84 rows 47 cols
[2024-06-01 12:36:15] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:36:15] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 12:36:15] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
[2024-06-01 12:36:15] [INFO ] Invariant cache hit.
[2024-06-01 12:36:15] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:36:15] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 89/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 38 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 38 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 34 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 34 transition count 77
Applied a total of 24 rules in 4 ms. Remains 34 /46 variables (removed 12) and now considering 77/89 (removed 12) transitions.
[2024-06-01 12:36:15] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
// Phase 1: matrix 72 rows 34 cols
[2024-06-01 12:36:15] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:36:15] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 12:36:15] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2024-06-01 12:36:15] [INFO ] Invariant cache hit.
[2024-06-01 12:36:15] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 12:36:15] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 34/53 places, 77/100 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 184 ms. Remains : 34/53 places, 77/100 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1, p1, p1, p1, true]
Running random walk in product with property : StigmergyElection-PT-04a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04a-LTLFireability-08 finished in 479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 51 transition count 83
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 35 transition count 83
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 33 place count 35 transition count 75
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 49 place count 27 transition count 75
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 23 transition count 67
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 23 transition count 67
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 64 place count 23 transition count 60
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 22 transition count 58
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 22 transition count 58
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 74 place count 22 transition count 50
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 80 place count 19 transition count 47
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 83 place count 19 transition count 44
Performed 4 Post agglomeration using F-continuation condition with reduction of 34 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 91 place count 15 transition count 51
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 106 place count 15 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 115 place count 15 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 116 place count 15 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 120 place count 11 transition count 23
Applied a total of 120 rules in 23 ms. Remains 11 /53 variables (removed 42) and now considering 23/100 (removed 77) transitions.
[2024-06-01 12:36:15] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
// Phase 1: matrix 17 rows 11 cols
[2024-06-01 12:36:15] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:36:15] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 12:36:15] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
[2024-06-01 12:36:15] [INFO ] Invariant cache hit.
[2024-06-01 12:36:15] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-06-01 12:36:15] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-06-01 12:36:15] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
[2024-06-01 12:36:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 12:36:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:36:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:36:15] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:36:15] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:36:15] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:36:15] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:36:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:36:16] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 3 ms to minimize.
[2024-06-01 12:36:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:36:16] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:36:16] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:36:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:36:16] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 16/27 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 12:36:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/27 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/28 variables, and 27 constraints, problems are : Problem set: 0 solved, 11 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 12:36:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 16/27 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/28 variables, and 39 constraints, problems are : Problem set: 0 solved, 11 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 15/15 constraints]
After SMT, in 518ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 518ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/53 places, 23/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 595 ms. Remains : 11/53 places, 23/100 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04a-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04a-LTLFireability-09 finished in 647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1 U (p2||G(p1))))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 100/100 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 49 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 49 transition count 93
Applied a total of 8 rules in 7 ms. Remains 49 /53 variables (removed 4) and now considering 93/100 (removed 7) transitions.
[2024-06-01 12:36:16] [INFO ] Flow matrix only has 87 transitions (discarded 6 similar events)
// Phase 1: matrix 87 rows 49 cols
[2024-06-01 12:36:16] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:36:16] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 12:36:16] [INFO ] Flow matrix only has 87 transitions (discarded 6 similar events)
[2024-06-01 12:36:16] [INFO ] Invariant cache hit.
[2024-06-01 12:36:16] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:36:16] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 100 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/53 places, 93/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 41 transition count 86
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 41 transition count 86
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 37 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 37 transition count 82
Applied a total of 22 rules in 3 ms. Remains 37 /48 variables (removed 11) and now considering 82/93 (removed 11) transitions.
[2024-06-01 12:36:16] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
// Phase 1: matrix 76 rows 37 cols
[2024-06-01 12:36:16] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:36:16] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 12:36:16] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
[2024-06-01 12:36:16] [INFO ] Invariant cache hit.
[2024-06-01 12:36:16] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 12:36:16] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 37/53 places, 82/100 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 179 ms. Remains : 37/53 places, 82/100 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-04a-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-04a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-04a-LTLFireability-10 finished in 673 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 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 51 transition count 91
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 43 transition count 91
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 17 place count 43 transition count 79
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 41 place count 31 transition count 79
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 50 place count 22 transition count 66
Iterating global reduction 2 with 9 rules applied. Total rules applied 59 place count 22 transition count 66
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 66 place count 22 transition count 59
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 21 transition count 57
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 21 transition count 57
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 76 place count 21 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 84 place count 17 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 88 place count 17 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 96 place count 13 transition count 37
Applied a total of 96 rules in 19 ms. Remains 13 /53 variables (removed 40) and now considering 37/100 (removed 63) transitions.
[2024-06-01 12:36:17] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 13 cols
[2024-06-01 12:36:17] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:36:17] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 12:36:17] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-06-01 12:36:17] [INFO ] Invariant cache hit.
[2024-06-01 12:36:17] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 12:36:17] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-06-01 12:36:17] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2024-06-01 12:36:17] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-06-01 12:36:17] [INFO ] Invariant cache hit.
[2024-06-01 12:36:17] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 4/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 31/44 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/45 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/45 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/45 variables, and 47 constraints, problems are : Problem set: 0 solved, 33 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 4/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 31/44 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 22/49 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 33/82 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 1/45 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/45 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/45 variables, and 83 constraints, problems are : Problem set: 0 solved, 33 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 13/13 constraints]
After SMT, in 1127ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 1128ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/53 places, 37/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1202 ms. Remains : 13/53 places, 37/100 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04a-LTLFireability-11
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04a-LTLFireability-11 finished in 1255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(p1&&G(p2))))))'
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 100/100 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 49 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 49 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 48 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 48 transition count 91
Applied a total of 10 rules in 5 ms. Remains 48 /53 variables (removed 5) and now considering 91/100 (removed 9) transitions.
[2024-06-01 12:36:18] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
// Phase 1: matrix 86 rows 48 cols
[2024-06-01 12:36:18] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:36:18] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 12:36:18] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2024-06-01 12:36:18] [INFO ] Invariant cache hit.
[2024-06-01 12:36:18] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:36:18] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-01 12:36:18] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2024-06-01 12:36:18] [INFO ] Invariant cache hit.
[2024-06-01 12:36:18] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:36:18] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:36:18] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:36:18] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:36:18] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:36:18] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:36:18] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:36:18] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:36:18] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:36:18] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:36:18] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:36:19] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:36:20] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:36:20] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:36:20] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:36:20] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:36:20] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:36:20] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 85/133 variables, 48/88 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 48/136 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 12:36:21] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (OVERLAPS) 1/134 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 14 (OVERLAPS) 0/134 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 138 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4083 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 85/133 variables, 48/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 48/137 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 90/227 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 228 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2986 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 39/39 constraints]
After SMT, in 7112ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 7113ms
Starting structural reductions in LTL mode, iteration 1 : 48/53 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7199 ms. Remains : 48/53 places, 91/100 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-04a-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 117 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (OR (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p1 p2)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p1 p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 120 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (318 resets) in 309 ms. (129 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (148 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
[2024-06-01 12:36:26] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2024-06-01 12:36:26] [INFO ] Invariant cache hit.
[2024-06-01 12:36:26] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 85/133 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 48/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/134 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 99 constraints, problems are : Problem set: 0 solved, 2 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/48 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 12:36:26] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:36:26] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:36:26] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:36:26] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
Problem apf4 is UNSAT
After SMT solving in domain Int declared 48/134 variables, and 10 constraints, problems are : Problem set: 2 solved, 0 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/48 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 475ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (OR (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p1 p2)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p1 p2))), (X (X p0)), (X (X p1)), (G (AND (OR p1 p0) (OR p2 p0))), (G (OR p2 p0))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (NOT p0)), (F (NOT (OR (NOT p2) p0))), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 109 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-04a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-04a-LTLFireability-12 finished in 8964 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(F(!p0)) U p0)))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 100/100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 48 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 48 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 47 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 47 transition count 89
Applied a total of 12 rules in 21 ms. Remains 47 /53 variables (removed 6) and now considering 89/100 (removed 11) transitions.
[2024-06-01 12:36:27] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
// Phase 1: matrix 84 rows 47 cols
[2024-06-01 12:36:27] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:36:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 12:36:27] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
[2024-06-01 12:36:27] [INFO ] Invariant cache hit.
[2024-06-01 12:36:27] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:36:27] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-06-01 12:36:27] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
[2024-06-01 12:36:27] [INFO ] Invariant cache hit.
[2024-06-01 12:36:27] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:36:27] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:36:28] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:36:29] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:36:29] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 83/130 variables, 47/80 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 48/128 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:36:29] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:36:29] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 1/131 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (OVERLAPS) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 131 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3751 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 12:36:31] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:36:31] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 83/130 variables, 47/84 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 48/132 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 88/220 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 221 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2809 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 35/35 constraints]
After SMT, in 6609ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 6612ms
Starting structural reductions in LTL mode, iteration 1 : 47/53 places, 89/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6713 ms. Remains : 47/53 places, 89/100 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), p0, p0]
Running random walk in product with property : StigmergyElection-PT-04a-LTLFireability-14
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04a-LTLFireability-14 finished in 6902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((!p0||G(F(!p0))))))))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 100/100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 48 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 48 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 47 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 47 transition count 89
Applied a total of 12 rules in 3 ms. Remains 47 /53 variables (removed 6) and now considering 89/100 (removed 11) transitions.
[2024-06-01 12:36:34] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
[2024-06-01 12:36:34] [INFO ] Invariant cache hit.
[2024-06-01 12:36:34] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 12:36:34] [INFO ] Flow matrix only has 84 transitions (discarded 5 similar events)
[2024-06-01 12:36:34] [INFO ] Invariant cache hit.
[2024-06-01 12:36:34] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 12:36:34] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 89/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 38 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 38 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 34 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 34 transition count 77
Applied a total of 24 rules in 2 ms. Remains 34 /46 variables (removed 12) and now considering 77/89 (removed 12) transitions.
[2024-06-01 12:36:34] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
// Phase 1: matrix 72 rows 34 cols
[2024-06-01 12:36:34] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:36:34] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 12:36:34] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2024-06-01 12:36:34] [INFO ] Invariant cache hit.
[2024-06-01 12:36:34] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 12:36:34] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 34/53 places, 77/100 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 34/53 places, 77/100 transitions.
Stuttering acceptance computed with spot in 152 ms :[p0, p0, p0, p0]
Running random walk in product with property : StigmergyElection-PT-04a-LTLFireability-15
Product exploration explored 100000 steps with 10000 reset in 175 ms.
Product exploration explored 100000 steps with 10000 reset in 224 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[p0, p0, p0, p0]
RANDOM walk for 36 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 153 ms :[p0, p0, p0, p0]
[2024-06-01 12:36:35] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2024-06-01 12:36:35] [INFO ] Invariant cache hit.
[2024-06-01 12:36:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 12:36:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 12:36:35] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 12:36:35] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-06-01 12:36:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:36:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 12:36:35] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 12:36:35] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-06-01 12:36:35] [INFO ] Computed and/alt/rep : 36/100/36 causal constraints (skipped 35 transitions) in 5 ms.
[2024-06-01 12:36:35] [INFO ] Added : 22 causal constraints over 5 iterations in 40 ms. Result :sat
Could not prove EG p0
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-06-01 12:36:35] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2024-06-01 12:36:35] [INFO ] Invariant cache hit.
[2024-06-01 12:36:35] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 12:36:35] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2024-06-01 12:36:35] [INFO ] Invariant cache hit.
[2024-06-01 12:36:35] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 12:36:35] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-06-01 12:36:35] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2024-06-01 12:36:35] [INFO ] Invariant cache hit.
[2024-06-01 12:36:35] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 12:36:36] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 12:36:37] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 71/105 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 32/88 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 1/106 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 89 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2458 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 12:36:38] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 71/105 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 32/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 76/165 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/106 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 166 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2262 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 22/22 constraints]
After SMT, in 4750ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 4751ms
Finished structural reductions in LTL mode , in 1 iterations and 4820 ms. Remains : 34/34 places, 77/77 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[p0, p0, p0, p0]
RANDOM walk for 36 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 186 ms :[p0, p0, p0, p0]
[2024-06-01 12:36:41] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2024-06-01 12:36:41] [INFO ] Invariant cache hit.
[2024-06-01 12:36:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 12:36:41] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 12:36:41] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 12:36:41] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-06-01 12:36:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:36:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 12:36:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 12:36:41] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-06-01 12:36:41] [INFO ] Computed and/alt/rep : 36/100/36 causal constraints (skipped 35 transitions) in 5 ms.
[2024-06-01 12:36:41] [INFO ] Added : 22 causal constraints over 5 iterations in 35 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 120 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 10000 reset in 106 ms.
Product exploration explored 100000 steps with 10000 reset in 104 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[p0, p0, p0, p0]
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 77/77 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 34 transition count 81
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 34 transition count 81
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 34 transition count 85
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 31 place count 34 transition count 70
Deduced a syphon composed of 16 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 34 transition count 62
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 34 transition count 62
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 26 transition count 54
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 26 transition count 54
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 59 rules in 15 ms. Remains 26 /34 variables (removed 8) and now considering 54/77 (removed 23) transitions.
[2024-06-01 12:36:42] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-01 12:36:42] [INFO ] Flow matrix only has 49 transitions (discarded 5 similar events)
// Phase 1: matrix 49 rows 26 cols
[2024-06-01 12:36:42] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:36:42] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
At refinement iteration 6 (OVERLAPS) 48/74 variables, 26/46 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 22/68 constraints. Problems are: Problem set: 16 solved, 37 unsolved
[2024-06-01 12:36:43] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 1/69 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/69 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 1/75 variables, 1/70 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/70 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 0/75 variables, 0/70 constraints. Problems are: Problem set: 16 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 70 constraints, problems are : Problem set: 16 solved, 37 unsolved in 1339 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 16 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 13/26 variables, 1/1 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 20/21 constraints. Problems are: Problem set: 16 solved, 37 unsolved
[2024-06-01 12:36:43] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 1/22 constraints. Problems are: Problem set: 16 solved, 37 unsolved
[2024-06-01 12:36:43] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/23 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/23 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 48/74 variables, 26/49 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 22/71 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 37/108 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/108 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 1/75 variables, 1/109 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/109 constraints. Problems are: Problem set: 16 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 0/75 variables, 0/109 constraints. Problems are: Problem set: 16 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 109 constraints, problems are : Problem set: 16 solved, 37 unsolved in 944 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 37/53 constraints, Known Traps: 22/22 constraints]
After SMT, in 2308ms problems are : Problem set: 16 solved, 37 unsolved
Search for dead transitions found 16 dead transitions in 2308ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 26/34 places, 38/77 transitions.
Graph (complete) has 69 edges and 26 vertex of which 14 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 14 /26 variables (removed 12) and now considering 38/38 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/34 places, 38/77 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2339 ms. Remains : 14/34 places, 38/77 transitions.
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 77/77 transitions.
Applied a total of 0 rules in 0 ms. Remains 34 /34 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-06-01 12:36:44] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
// Phase 1: matrix 72 rows 34 cols
[2024-06-01 12:36:44] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:36:44] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 12:36:44] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2024-06-01 12:36:44] [INFO ] Invariant cache hit.
[2024-06-01 12:36:44] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 12:36:44] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-06-01 12:36:44] [INFO ] Flow matrix only has 72 transitions (discarded 5 similar events)
[2024-06-01 12:36:44] [INFO ] Invariant cache hit.
[2024-06-01 12:36:44] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 12:36:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:36:44] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:36:44] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:36:44] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:36:44] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:36:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:36:44] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:36:44] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 12:36:45] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 71/105 variables, 34/56 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 32/88 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 1/106 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 89 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2485 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 12:36:47] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 71/105 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 32/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 76/165 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/106 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 166 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 22/22 constraints]
After SMT, in 4699ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 4701ms
Finished structural reductions in LTL mode , in 1 iterations and 4770 ms. Remains : 34/34 places, 77/77 transitions.
Treatment of property StigmergyElection-PT-04a-LTLFireability-15 finished in 15121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((!p0||G(F(!p0))))))))'
Found a Shortening insensitive property : StigmergyElection-PT-04a-LTLFireability-15
Stuttering acceptance computed with spot in 153 ms :[p0, p0, p0, p0]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 53/53 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 51 transition count 91
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 43 transition count 91
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 17 place count 43 transition count 79
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 41 place count 31 transition count 79
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 50 place count 22 transition count 66
Iterating global reduction 2 with 9 rules applied. Total rules applied 59 place count 22 transition count 66
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 66 place count 22 transition count 59
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 21 transition count 57
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 21 transition count 57
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 76 place count 21 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 84 place count 17 transition count 45
Applied a total of 84 rules in 11 ms. Remains 17 /53 variables (removed 36) and now considering 45/100 (removed 55) transitions.
[2024-06-01 12:36:49] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 17 cols
[2024-06-01 12:36:49] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:36:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 12:36:49] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2024-06-01 12:36:49] [INFO ] Invariant cache hit.
[2024-06-01 12:36:49] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 12:36:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2024-06-01 12:36:49] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2024-06-01 12:36:49] [INFO ] Invariant cache hit.
[2024-06-01 12:36:49] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 4/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 12:36:49] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:36:49] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-06-01 12:36:49] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:36:49] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:36:49] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:36:49] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:36:49] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:36:49] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:36:49] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:36:49] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:36:49] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:36:49] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 12:36:50] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 39/56 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/57 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 12:36:50] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/57 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 55 constraints, problems are : Problem set: 0 solved, 41 unsolved in 818 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 4/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 39/56 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 41/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/57 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 96 constraints, problems are : Problem set: 0 solved, 41 unsolved in 565 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 14/14 constraints]
After SMT, in 1402ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1404ms
Starting structural reductions in LI_LTL mode, iteration 1 : 17/53 places, 45/100 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1466 ms. Remains : 17/53 places, 45/100 transitions.
Running random walk in product with property : StigmergyElection-PT-04a-LTLFireability-15
Product exploration explored 100000 steps with 20000 reset in 90 ms.
Product exploration explored 100000 steps with 20000 reset in 94 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[p0, p0, p0, p0]
RANDOM walk for 16 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 157 ms :[p0, p0, p0, p0]
[2024-06-01 12:36:51] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2024-06-01 12:36:51] [INFO ] Invariant cache hit.
[2024-06-01 12:36:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 12:36:51] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 12:36:51] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 12:36:51] [INFO ] [Real]Added 23 Read/Feed constraints in 2 ms returned sat
[2024-06-01 12:36:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:36:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 12:36:51] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 12:36:51] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2024-06-01 12:36:51] [INFO ] Computed and/alt/rep : 12/68/12 causal constraints (skipped 24 transitions) in 3 ms.
[2024-06-01 12:36:51] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG p0
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-01 12:36:51] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2024-06-01 12:36:51] [INFO ] Invariant cache hit.
[2024-06-01 12:36:51] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 12:36:51] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2024-06-01 12:36:51] [INFO ] Invariant cache hit.
[2024-06-01 12:36:52] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 12:36:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2024-06-01 12:36:52] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2024-06-01 12:36:52] [INFO ] Invariant cache hit.
[2024-06-01 12:36:52] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 4/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 39/56 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/57 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/57 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 55 constraints, problems are : Problem set: 0 solved, 41 unsolved in 806 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 4/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 39/56 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 41/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/57 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 96 constraints, problems are : Problem set: 0 solved, 41 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 14/14 constraints]
After SMT, in 1378ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1380ms
Finished structural reductions in LTL mode , in 1 iterations and 1429 ms. Remains : 17/17 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[p0, p0, p0, p0]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 170 ms :[p0, p0, p0, p0]
[2024-06-01 12:36:54] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2024-06-01 12:36:54] [INFO ] Invariant cache hit.
[2024-06-01 12:36:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 12:36:54] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 12:36:54] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 12:36:54] [INFO ] [Real]Added 23 Read/Feed constraints in 2 ms returned sat
[2024-06-01 12:36:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:36:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 12:36:54] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 12:36:54] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2024-06-01 12:36:54] [INFO ] Computed and/alt/rep : 12/68/12 causal constraints (skipped 24 transitions) in 2 ms.
[2024-06-01 12:36:54] [INFO ] Added : 4 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 158 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 20000 reset in 91 ms.
Product exploration explored 100000 steps with 20000 reset in 94 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 140 ms :[p0, p0, p0, p0]
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 45/45 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 17 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 17 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 8 rules in 9 ms. Remains 17 /17 variables (removed 0) and now considering 41/45 (removed 4) transitions.
[2024-06-01 12:36:54] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2024-06-01 12:36:54] [INFO ] Flow matrix only has 36 transitions (discarded 5 similar events)
// Phase 1: matrix 36 rows 17 cols
[2024-06-01 12:36:54] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:36:54] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 4/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-01 12:36:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:36:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:36:54] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:36:54] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:36:54] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:36:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:36:55] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-01 12:36:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:36:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:36:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:36:55] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-01 12:36:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-01 12:36:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:36:55] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:36:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
At refinement iteration 7 (OVERLAPS) 35/52 variables, 17/33 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 22/55 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/55 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 1/53 variables, 1/56 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 0/56 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/53 variables, 0/56 constraints. Problems are: Problem set: 4 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 56 constraints, problems are : Problem set: 4 solved, 33 unsolved in 817 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 4 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 8/17 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 15/16 constraints. Problems are: Problem set: 4 solved, 33 unsolved
[2024-06-01 12:36:55] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:36:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 2/18 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 35/52 variables, 17/35 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 22/57 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 33/90 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/90 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 1/53 variables, 1/91 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/91 constraints. Problems are: Problem set: 4 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 0/53 variables, 0/91 constraints. Problems are: Problem set: 4 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 91 constraints, problems are : Problem set: 4 solved, 33 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 33/37 constraints, Known Traps: 17/17 constraints]
After SMT, in 1396ms problems are : Problem set: 4 solved, 33 unsolved
Search for dead transitions found 4 dead transitions in 1396ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 17/17 places, 37/45 transitions.
Graph (complete) has 65 edges and 17 vertex of which 13 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 13 /17 variables (removed 4) and now considering 37/37 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/17 places, 37/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1418 ms. Remains : 13/17 places, 37/45 transitions.
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-01 12:36:56] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 17 cols
[2024-06-01 12:36:56] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:36:56] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 12:36:56] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2024-06-01 12:36:56] [INFO ] Invariant cache hit.
[2024-06-01 12:36:56] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 12:36:56] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2024-06-01 12:36:56] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2024-06-01 12:36:56] [INFO ] Invariant cache hit.
[2024-06-01 12:36:56] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 4/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 12:36:56] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:36:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:36:56] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:36:56] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:36:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:36:56] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:36:56] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:36:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:36:56] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:36:56] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:36:56] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:36:56] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 12:36:56] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 39/56 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/57 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 12:36:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/57 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 55 constraints, problems are : Problem set: 0 solved, 41 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 4/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 39/56 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 41/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/57 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 96 constraints, problems are : Problem set: 0 solved, 41 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 14/14 constraints]
After SMT, in 1451ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1451ms
Finished structural reductions in LTL mode , in 1 iterations and 1511 ms. Remains : 17/17 places, 45/45 transitions.
Treatment of property StigmergyElection-PT-04a-LTLFireability-15 finished in 8428 ms.
[2024-06-01 12:36:57] [INFO ] Flatten gal took : 6 ms
[2024-06-01 12:36:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 12:36:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 53 places, 100 transitions and 446 arcs took 3 ms.
Total runtime 52544 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyElection-PT-04a-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717245417983

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyElection-PT-04a-LTLFireability-15
ltl formula formula --ltl=/tmp/2234/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 53 places, 100 transitions and 446 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2234/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2234/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2234/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2234/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 55 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 54, there are 111 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 82
pnml2lts-mc( 0/ 4): unique states count: 82
pnml2lts-mc( 0/ 4): unique transitions count: 589
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 508
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 106
pnml2lts-mc( 0/ 4): - cum. max stack depth: 37
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 106 states 749 transitions, fanout: 7.066
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 16.0 B/state, compr.: 7.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 100 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-04a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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