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.r508-tall-171654351700459.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 NeoElection-COL-4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351700459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 11 18:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 11 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 18:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 18:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 18:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 18:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 81K 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 NeoElection-COL-4-LTLCardinality-00
FORMULA_NAME NeoElection-COL-4-LTLCardinality-01
FORMULA_NAME NeoElection-COL-4-LTLCardinality-02
FORMULA_NAME NeoElection-COL-4-LTLCardinality-03
FORMULA_NAME NeoElection-COL-4-LTLCardinality-04
FORMULA_NAME NeoElection-COL-4-LTLCardinality-05
FORMULA_NAME NeoElection-COL-4-LTLCardinality-06
FORMULA_NAME NeoElection-COL-4-LTLCardinality-07
FORMULA_NAME NeoElection-COL-4-LTLCardinality-08
FORMULA_NAME NeoElection-COL-4-LTLCardinality-09
FORMULA_NAME NeoElection-COL-4-LTLCardinality-10
FORMULA_NAME NeoElection-COL-4-LTLCardinality-11
FORMULA_NAME NeoElection-COL-4-LTLCardinality-12
FORMULA_NAME NeoElection-COL-4-LTLCardinality-13
FORMULA_NAME NeoElection-COL-4-LTLCardinality-14
FORMULA_NAME NeoElection-COL-4-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717238529205

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:42:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:42:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:42:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 10:42:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 10:42:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 610 ms
[2024-06-01 10:42:11] [INFO ] Detected 6 constant HL places corresponding to 870 PT places.
[2024-06-01 10:42:11] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 1830 PT places and 3990.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 10:42:11] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2024-06-01 10:42:11] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 6 formulas.
FORMULA NeoElection-COL-4-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Remains 10 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-4-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 40000 steps (1381 resets) in 468 ms. (85 steps per ms) remains 1/9 properties
BEST_FIRST walk for 196 steps (0 resets) in 4 ms. (39 steps per ms) remains 0/1 properties
[2024-06-01 10:42:11] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-06-01 10:42:11] [INFO ] Flatten gal took : 14 ms
FORMULA NeoElection-COL-4-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 10:42:11] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Domain [M(5), POS(4), M(5)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 4)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 10:42:11] [INFO ] Unfolded HLPN to a Petri net with 1830 places and 1984 transitions 11141 arcs in 76 ms.
[2024-06-01 10:42:11] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Deduced a syphon composed of 1687 places in 6 ms
Reduce places removed 1703 places and 1857 transitions.
Reduce places removed 5 places and 0 transitions.
Support contains 76 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 127/127 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 110 transition count 127
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 20 place count 102 transition count 91
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 102 transition count 91
Applied a total of 28 rules in 14 ms. Remains 102 /122 variables (removed 20) and now considering 91/127 (removed 36) transitions.
[2024-06-01 10:42:11] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
// Phase 1: matrix 82 rows 102 cols
[2024-06-01 10:42:11] [INFO ] Computed 23 invariants in 18 ms
[2024-06-01 10:42:12] [INFO ] Implicit Places using invariants in 290 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 316 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/122 places, 91/127 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 343 ms. Remains : 86/122 places, 91/127 transitions.
Support contains 76 out of 86 places after structural reductions.
[2024-06-01 10:42:12] [INFO ] Flatten gal took : 16 ms
[2024-06-01 10:42:12] [INFO ] Flatten gal took : 11 ms
[2024-06-01 10:42:12] [INFO ] Input system was already deterministic with 91 transitions.
RANDOM walk for 40000 steps (236 resets) in 600 ms. (66 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40003 steps (46 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
[2024-06-01 10:42:12] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
// Phase 1: matrix 82 rows 86 cols
[2024-06-01 10:42:12] [INFO ] Computed 7 invariants in 4 ms
[2024-06-01 10:42:12] [INFO ] State equation strengthened by 6 read => feed constraints.
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 4/168 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/86 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 86 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 91/91 transitions.
Reduce places removed 4 places and 4 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 74
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 74
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 36 place count 64 transition count 66
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 60 transition count 62
Applied a total of 40 rules in 18 ms. Remains 60 /86 variables (removed 26) and now considering 62/91 (removed 29) transitions.
[2024-06-01 10:42:12] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 60 cols
[2024-06-01 10:42:12] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 10:42:12] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 10:42:12] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2024-06-01 10:42:12] [INFO ] Invariant cache hit.
[2024-06-01 10:42:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 10:42:12] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-06-01 10:42:12] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-01 10:42:12] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2024-06-01 10:42:12] [INFO ] Invariant cache hit.
[2024-06-01 10:42:12] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 4/60 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Problem TDEAD8 is UNSAT
At refinement iteration 4 (OVERLAPS) 53/113 variables, 60/67 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 3/70 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 70 constraints, problems are : Problem set: 1 solved, 57 unsolved in 829 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 60/60 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 4/60 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 53/113 variables, 60/67 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 3/70 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 57/127 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/113 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 127 constraints, problems are : Problem set: 1 solved, 57 unsolved in 820 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 60/60 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 57/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 1678ms problems are : Problem set: 1 solved, 57 unsolved
Search for dead transitions found 1 dead transitions in 1679ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 60/86 places, 61/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 10:42:14] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 1854 ms. Remains : 60/86 places, 61/91 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLCardinality-04
Product exploration explored 100000 steps with 653 reset in 364 ms.
Product exploration explored 100000 steps with 653 reset in 228 ms.
Computed a total of 60 stabilizing places and 61 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 61
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-4-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-4-LTLCardinality-04 finished in 2694 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&&G(F(p1)))))'
Support contains 52 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 82 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 82 transition count 87
Applied a total of 8 rules in 2 ms. Remains 82 /86 variables (removed 4) and now considering 87/91 (removed 4) transitions.
[2024-06-01 10:42:15] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
// Phase 1: matrix 78 rows 82 cols
[2024-06-01 10:42:15] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 10:42:15] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 10:42:15] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
[2024-06-01 10:42:15] [INFO ] Invariant cache hit.
[2024-06-01 10:42:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 10:42:15] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-06-01 10:42:15] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
[2024-06-01 10:42:15] [INFO ] Invariant cache hit.
[2024-06-01 10:42:15] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 4/82 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 78/160 variables, 82/89 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 6/95 constraints. Problems are: Problem set: 1 solved, 82 unsolved
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 7 ms to minimize.
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 2 ms to minimize.
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 12/107 constraints. Problems are: Problem set: 1 solved, 82 unsolved
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:42:16] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 3/110 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 110 constraints, problems are : Problem set: 1 solved, 82 unsolved in 2548 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 1 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 4/82 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 15/22 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 78/160 variables, 82/104 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 6/110 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 82/192 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 192 constraints, problems are : Problem set: 1 solved, 82 unsolved in 1760 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 82/83 constraints, Known Traps: 15/15 constraints]
After SMT, in 4347ms problems are : Problem set: 1 solved, 82 unsolved
Search for dead transitions found 1 dead transitions in 4349ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 82/86 places, 86/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4452 ms. Remains : 82/86 places, 86/91 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NeoElection-COL-4-LTLCardinality-05
Stuttering criterion allowed to conclude after 1400 steps with 43 reset in 20 ms.
FORMULA NeoElection-COL-4-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLCardinality-05 finished in 4691 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 48 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 82 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 82 transition count 87
Applied a total of 8 rules in 2 ms. Remains 82 /86 variables (removed 4) and now considering 87/91 (removed 4) transitions.
[2024-06-01 10:42:19] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
[2024-06-01 10:42:19] [INFO ] Invariant cache hit.
[2024-06-01 10:42:19] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 10:42:19] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
[2024-06-01 10:42:19] [INFO ] Invariant cache hit.
[2024-06-01 10:42:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 10:42:20] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-06-01 10:42:20] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
[2024-06-01 10:42:20] [INFO ] Invariant cache hit.
[2024-06-01 10:42:20] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 4/82 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 78/160 variables, 82/89 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 6/95 constraints. Problems are: Problem set: 1 solved, 82 unsolved
[2024-06-01 10:42:20] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:42:20] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
[2024-06-01 10:42:20] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:42:20] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 12/107 constraints. Problems are: Problem set: 1 solved, 82 unsolved
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:42:21] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 3/110 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 110 constraints, problems are : Problem set: 1 solved, 82 unsolved in 2466 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 1 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 4/82 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 15/22 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 78/160 variables, 82/104 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 6/110 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 82/192 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 192 constraints, problems are : Problem set: 1 solved, 82 unsolved in 1721 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 82/83 constraints, Known Traps: 15/15 constraints]
After SMT, in 4218ms problems are : Problem set: 1 solved, 82 unsolved
Search for dead transitions found 1 dead transitions in 4219ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 82/86 places, 86/91 transitions.
Applied a total of 0 rules in 7 ms. Remains 82 /82 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4317 ms. Remains : 82/86 places, 86/91 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-4-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLCardinality-10 finished in 4431 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)&&F(G(p1))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 91/91 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 86 transition count 87
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 82 transition count 87
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 82 transition count 83
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 78 transition count 83
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 26 place count 68 transition count 70
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 68 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 36 place count 68 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 44 place count 64 transition count 66
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 60 place count 56 transition count 58
Applied a total of 60 rules in 19 ms. Remains 56 /86 variables (removed 30) and now considering 58/91 (removed 33) transitions.
[2024-06-01 10:42:24] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
// Phase 1: matrix 49 rows 56 cols
[2024-06-01 10:42:24] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 10:42:24] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 10:42:24] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-06-01 10:42:24] [INFO ] Invariant cache hit.
[2024-06-01 10:42:24] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 10:42:24] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-06-01 10:42:24] [INFO ] Redundant transitions in 0 ms returned []
Running 54 sub problems to find dead transitions.
[2024-06-01 10:42:24] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-06-01 10:42:24] [INFO ] Invariant cache hit.
[2024-06-01 10:42:24] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem TDEAD30 is UNSAT
At refinement iteration 4 (OVERLAPS) 49/105 variables, 56/63 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 45/108 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 108 constraints, problems are : Problem set: 1 solved, 53 unsolved in 587 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 49/105 variables, 56/63 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 45/108 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 53/161 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 161 constraints, problems are : Problem set: 1 solved, 53 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 53/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 1193ms problems are : Problem set: 1 solved, 53 unsolved
Search for dead transitions found 1 dead transitions in 1194ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 56/86 places, 57/91 transitions.
Applied a total of 0 rules in 8 ms. Remains 56 /56 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-06-01 10:42:25] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 1337 ms. Remains : 56/86 places, 57/91 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NeoElection-COL-4-LTLCardinality-11
Product exploration explored 100000 steps with 1886 reset in 188 ms.
Product exploration explored 100000 steps with 1886 reset in 184 ms.
Computed a total of 56 stabilizing places and 57 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 57
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-4-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-4-LTLCardinality-11 finished in 1891 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) U G(p1))))'
Support contains 64 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-06-01 10:42:26] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
// Phase 1: matrix 82 rows 86 cols
[2024-06-01 10:42:26] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 10:42:26] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 10:42:26] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2024-06-01 10:42:26] [INFO ] Invariant cache hit.
[2024-06-01 10:42:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 10:42:26] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-06-01 10:42:26] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2024-06-01 10:42:26] [INFO ] Invariant cache hit.
[2024-06-01 10:42:26] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 4/86 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 82/168 variables, 86/93 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 6/99 constraints. Problems are: Problem set: 1 solved, 86 unsolved
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 3 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 15/114 constraints. Problems are: Problem set: 1 solved, 86 unsolved
[2024-06-01 10:42:27] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:42:28] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:42:28] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 3/117 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 117 constraints, problems are : Problem set: 1 solved, 86 unsolved in 2496 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 1 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 4/86 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 18/25 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 82/168 variables, 86/111 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 6/117 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 86/203 constraints. Problems are: Problem set: 1 solved, 86 unsolved
[2024-06-01 10:42:29] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 1/204 constraints. Problems are: Problem set: 1 solved, 86 unsolved
[2024-06-01 10:42:30] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:42:30] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 2/206 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 206 constraints, problems are : Problem set: 1 solved, 86 unsolved in 3208 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 86/87 constraints, Known Traps: 21/21 constraints]
After SMT, in 5727ms problems are : Problem set: 1 solved, 86 unsolved
Search for dead transitions found 1 dead transitions in 5729ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 86/86 places, 90/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5832 ms. Remains : 86/86 places, 90/91 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLCardinality-12
Product exploration explored 100000 steps with 3085 reset in 182 ms.
Product exploration explored 100000 steps with 3100 reset in 186 ms.
Computed a total of 86 stabilizing places and 90 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 90
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 382 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Support contains 48 out of 86 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 90/90 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 86 transition count 86
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 82 transition count 86
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 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 82
Applied a total of 16 rules in 12 ms. Remains 78 /86 variables (removed 8) and now considering 82/90 (removed 8) transitions.
[2024-06-01 10:42:33] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 78 cols
[2024-06-01 10:42:33] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 10:42:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 10:42:33] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2024-06-01 10:42:33] [INFO ] Invariant cache hit.
[2024-06-01 10:42:33] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 10:42:33] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-06-01 10:42:33] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-06-01 10:42:33] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2024-06-01 10:42:33] [INFO ] Invariant cache hit.
[2024-06-01 10:42:33] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 4/78 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 10:42:33] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:42:33] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 73/151 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 53/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 141 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 4/78 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 73/151 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 53/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 78/219 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 219 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1094 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
After SMT, in 2383ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 2385ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/86 places, 82/90 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2502 ms. Remains : 78/86 places, 82/90 transitions.
Computed a total of 78 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 transition count 82
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1449 reset in 273 ms.
Product exploration explored 100000 steps with 1449 reset in 284 ms.
Support contains 48 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 82/82 transitions.
Reduce places removed 4 places and 4 transitions.
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 0 with 8 rules applied. Total rules applied 8 place count 70 transition count 74
Applied a total of 8 rules in 4 ms. Remains 70 /78 variables (removed 8) and now considering 74/82 (removed 8) transitions.
[2024-06-01 10:42:36] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
// Phase 1: matrix 65 rows 70 cols
[2024-06-01 10:42:36] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 10:42:36] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 10:42:36] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2024-06-01 10:42:36] [INFO ] Invariant cache hit.
[2024-06-01 10:42:37] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 10:42:37] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-01 10:42:37] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-06-01 10:42:37] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2024-06-01 10:42:37] [INFO ] Invariant cache hit.
[2024-06-01 10:42:37] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 4/70 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 65/135 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 53/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 131 constraints, problems are : Problem set: 0 solved, 70 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 4/70 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 65/135 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 53/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 70/201 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 201 constraints, problems are : Problem set: 0 solved, 70 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 1801ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 1802ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/78 places, 74/82 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1896 ms. Remains : 70/78 places, 74/82 transitions.
Treatment of property NeoElection-COL-4-LTLCardinality-12 finished in 12624 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(G(!p1))))'
Support contains 64 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-06-01 10:42:38] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
// Phase 1: matrix 82 rows 86 cols
[2024-06-01 10:42:38] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 10:42:38] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 10:42:38] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2024-06-01 10:42:38] [INFO ] Invariant cache hit.
[2024-06-01 10:42:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 10:42:38] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-06-01 10:42:38] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2024-06-01 10:42:38] [INFO ] Invariant cache hit.
[2024-06-01 10:42:38] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 4/86 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 82/168 variables, 86/93 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 6/99 constraints. Problems are: Problem set: 1 solved, 86 unsolved
[2024-06-01 10:42:39] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:42:39] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
[2024-06-01 10:42:39] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 4 ms to minimize.
[2024-06-01 10:42:39] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:42:40] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:42:40] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:42:40] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:42:40] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:42:40] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:42:40] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:42:40] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:42:40] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:42:40] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:42:40] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:42:40] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 15/114 constraints. Problems are: Problem set: 1 solved, 86 unsolved
[2024-06-01 10:42:40] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:42:40] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:42:40] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 3/117 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 117 constraints, problems are : Problem set: 1 solved, 86 unsolved in 2504 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 1 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 4/86 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 18/25 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 82/168 variables, 86/111 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 6/117 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 86/203 constraints. Problems are: Problem set: 1 solved, 86 unsolved
[2024-06-01 10:42:42] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 1/204 constraints. Problems are: Problem set: 1 solved, 86 unsolved
[2024-06-01 10:42:42] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:42:42] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 2/206 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 206 constraints, problems are : Problem set: 1 solved, 86 unsolved in 3216 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 86/87 constraints, Known Traps: 21/21 constraints]
After SMT, in 5749ms problems are : Problem set: 1 solved, 86 unsolved
Search for dead transitions found 1 dead transitions in 5750ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 86/86 places, 90/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5843 ms. Remains : 86/86 places, 90/91 transitions.
Stuttering acceptance computed with spot in 127 ms :[p1, true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : NeoElection-COL-4-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-4-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLCardinality-14 finished in 5984 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) U G(p1))))'
Found a Lengthening insensitive property : NeoElection-COL-4-LTLCardinality-12
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 64 out of 86 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 86/86 places, 91/91 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 86 transition count 87
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 82 transition count 87
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 83
Applied a total of 16 rules in 9 ms. Remains 78 /86 variables (removed 8) and now considering 83/91 (removed 8) transitions.
[2024-06-01 10:42:45] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 78 cols
[2024-06-01 10:42:45] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 10:42:45] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 10:42:45] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2024-06-01 10:42:45] [INFO ] Invariant cache hit.
[2024-06-01 10:42:45] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 10:42:45] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-06-01 10:42:45] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2024-06-01 10:42:45] [INFO ] Invariant cache hit.
[2024-06-01 10:42:45] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 4/78 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Problem TDEAD57 is UNSAT
At refinement iteration 4 (OVERLAPS) 74/152 variables, 78/85 constraints. Problems are: Problem set: 1 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 54/139 constraints. Problems are: Problem set: 1 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 139 constraints, problems are : Problem set: 1 solved, 78 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 4/78 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 74/152 variables, 78/85 constraints. Problems are: Problem set: 1 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 54/139 constraints. Problems are: Problem set: 1 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 78/217 constraints. Problems are: Problem set: 1 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 217 constraints, problems are : Problem set: 1 solved, 78 unsolved in 1091 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 78/79 constraints, Known Traps: 0/0 constraints]
After SMT, in 2166ms problems are : Problem set: 1 solved, 78 unsolved
Search for dead transitions found 1 dead transitions in 2167ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 78/86 places, 82/91 transitions.
Applied a total of 0 rules in 6 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2268 ms. Remains : 78/86 places, 82/91 transitions.
Running random walk in product with property : NeoElection-COL-4-LTLCardinality-12
Product exploration explored 100000 steps with 2817 reset in 177 ms.
Product exploration explored 100000 steps with 2821 reset in 191 ms.
Computed a total of 78 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 transition count 82
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 269 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Support contains 48 out of 78 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 6 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 10:42:48] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 78 cols
[2024-06-01 10:42:48] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 10:42:48] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 10:42:48] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2024-06-01 10:42:48] [INFO ] Invariant cache hit.
[2024-06-01 10:42:48] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 10:42:48] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-01 10:42:48] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-06-01 10:42:48] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2024-06-01 10:42:48] [INFO ] Invariant cache hit.
[2024-06-01 10:42:48] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 4/78 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 10:42:48] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 1 ms to minimize.
[2024-06-01 10:42:48] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 73/151 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 53/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 141 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1218 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 4/78 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 73/151 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 53/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 78/219 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 219 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1111 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
After SMT, in 2339ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 2340ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2439 ms. Remains : 78/78 places, 82/82 transitions.
Computed a total of 78 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 transition count 82
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1449 reset in 267 ms.
Product exploration explored 100000 steps with 1449 reset in 292 ms.
Support contains 48 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 82/82 transitions.
Reduce places removed 4 places and 4 transitions.
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 0 with 8 rules applied. Total rules applied 8 place count 70 transition count 74
Applied a total of 8 rules in 4 ms. Remains 70 /78 variables (removed 8) and now considering 74/82 (removed 8) transitions.
[2024-06-01 10:42:51] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
// Phase 1: matrix 65 rows 70 cols
[2024-06-01 10:42:51] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 10:42:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 10:42:52] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2024-06-01 10:42:52] [INFO ] Invariant cache hit.
[2024-06-01 10:42:52] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 10:42:52] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-01 10:42:52] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-06-01 10:42:52] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2024-06-01 10:42:52] [INFO ] Invariant cache hit.
[2024-06-01 10:42:52] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 4/70 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 65/135 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 53/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 131 constraints, problems are : Problem set: 0 solved, 70 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 4/70 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 65/135 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 53/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 70/201 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 201 constraints, problems are : Problem set: 0 solved, 70 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 1799ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 1799ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/78 places, 74/82 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1897 ms. Remains : 70/78 places, 74/82 transitions.
Treatment of property NeoElection-COL-4-LTLCardinality-12 finished in 9011 ms.
[2024-06-01 10:42:53] [INFO ] Flatten gal took : 12 ms
[2024-06-01 10:42:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 10:42:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 86 places, 91 transitions and 362 arcs took 3 ms.
Total runtime 43582 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024

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="NeoElection-COL-4"
export BK_EXAMINATION="LTLCardinality"
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 NeoElection-COL-4, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654351700459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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