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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.0K Apr 11 20:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 11 20:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 19:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 11 19:25 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.0K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 22:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 22:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 21:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 21:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 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 120K 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-8-LTLCardinality-00
FORMULA_NAME NeoElection-COL-8-LTLCardinality-01
FORMULA_NAME NeoElection-COL-8-LTLCardinality-02
FORMULA_NAME NeoElection-COL-8-LTLCardinality-03
FORMULA_NAME NeoElection-COL-8-LTLCardinality-04
FORMULA_NAME NeoElection-COL-8-LTLCardinality-05
FORMULA_NAME NeoElection-COL-8-LTLCardinality-06
FORMULA_NAME NeoElection-COL-8-LTLCardinality-07
FORMULA_NAME NeoElection-COL-8-LTLCardinality-08
FORMULA_NAME NeoElection-COL-8-LTLCardinality-09
FORMULA_NAME NeoElection-COL-8-LTLCardinality-10
FORMULA_NAME NeoElection-COL-8-LTLCardinality-11
FORMULA_NAME NeoElection-COL-8-LTLCardinality-12
FORMULA_NAME NeoElection-COL-8-LTLCardinality-13
FORMULA_NAME NeoElection-COL-8-LTLCardinality-14
FORMULA_NAME NeoElection-COL-8-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717239175065

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-8
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:52:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:52:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:52:56] [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:52:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 10:52:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 699 ms
[2024-06-01 10:52:57] [INFO ] Detected 6 constant HL places corresponding to 5058 PT places.
[2024-06-01 10:52:57] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 10062 PT places and 34578.0 transition bindings in 38 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 10:52:57] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 4 ms.
[2024-06-01 10:52:57] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA NeoElection-COL-8-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-15 FALSE 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.3 ms
Remains 12 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-8-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 265 steps (4 resets) in 31 ms. (8 steps per ms) remains 0/6 properties
[2024-06-01 10:52:57] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2024-06-01 10:52:57] [INFO ] Flatten gal took : 13 ms
FORMULA NeoElection-COL-8-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 10:52:57] [INFO ] Flatten gal took : 1 ms
Domain [M(9), POS(8), M(9)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 8)]] contains successor/predecessor on variables of sort POS
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.
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:52:57] [INFO ] Unfolded HLPN to a Petri net with 10062 places and 19858 transitions 113083 arcs in 254 ms.
[2024-06-01 10:52:57] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Deduced a syphon composed of 9487 places in 50 ms
Reduce places removed 9551 places and 18965 transitions.
Reduce places removed 9 places and 0 transitions.
Support contains 80 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 893/893 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 446 transition count 893
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 146 place count 356 transition count 326
Iterating global reduction 1 with 90 rules applied. Total rules applied 236 place count 356 transition count 326
Applied a total of 236 rules in 95 ms. Remains 356 /502 variables (removed 146) and now considering 326/893 (removed 567) transitions.
[2024-06-01 10:52:57] [INFO ] Flow matrix only has 277 transitions (discarded 49 similar events)
// Phase 1: matrix 277 rows 356 cols
[2024-06-01 10:52:57] [INFO ] Computed 79 invariants in 30 ms
[2024-06-01 10:52:58] [INFO ] Implicit Places using invariants in 512 ms returned [22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 551 ms to find 64 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 292/502 places, 326/893 transitions.
Applied a total of 0 rules in 5 ms. Remains 292 /292 variables (removed 0) and now considering 326/326 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 686 ms. Remains : 292/502 places, 326/893 transitions.
Support contains 80 out of 292 places after structural reductions.
[2024-06-01 10:52:58] [INFO ] Flatten gal took : 38 ms
[2024-06-01 10:52:58] [INFO ] Flatten gal took : 31 ms
[2024-06-01 10:52:58] [INFO ] Input system was already deterministic with 326 transitions.
RANDOM walk for 337 steps (0 resets) in 40 ms. (8 steps per ms) remains 0/4 properties
Computed a total of 292 stabilizing places and 326 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 292 transition count 326
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' '!(X(F(p0)))'
Support contains 8 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 326/326 transitions.
Applied a total of 0 rules in 5 ms. Remains 292 /292 variables (removed 0) and now considering 326/326 (removed 0) transitions.
[2024-06-01 10:52:58] [INFO ] Flow matrix only has 277 transitions (discarded 49 similar events)
// Phase 1: matrix 277 rows 292 cols
[2024-06-01 10:52:58] [INFO ] Computed 15 invariants in 4 ms
[2024-06-01 10:52:58] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 10:52:58] [INFO ] Flow matrix only has 277 transitions (discarded 49 similar events)
[2024-06-01 10:52:58] [INFO ] Invariant cache hit.
[2024-06-01 10:52:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 10:52:59] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2024-06-01 10:52:59] [INFO ] Flow matrix only has 277 transitions (discarded 49 similar events)
[2024-06-01 10:52:59] [INFO ] Invariant cache hit.
[2024-06-01 10:52:59] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 8/292 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Problem TDEAD20 is UNSAT
At refinement iteration 4 (OVERLAPS) 277/569 variables, 292/307 constraints. Problems are: Problem set: 1 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 7/314 constraints. Problems are: Problem set: 1 solved, 317 unsolved
[2024-06-01 10:53:07] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 11 ms to minimize.
[2024-06-01 10:53:07] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 2 ms to minimize.
[2024-06-01 10:53:07] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:53:07] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:53:07] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:53:07] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:53:07] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:53:07] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:53:07] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:53:07] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:53:07] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:53:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:53:07] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:53:08] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:53:08] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:53:08] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:53:08] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:53:08] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:53:08] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:53:08] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 20/334 constraints. Problems are: Problem set: 1 solved, 317 unsolved
[2024-06-01 10:53:10] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-06-01 10:53:10] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 10:53:10] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-06-01 10:53:10] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:53:11] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:53:11] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:53:11] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:53:11] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:53:11] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:53:11] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:53:12] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:53:12] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:53:12] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:53:12] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:53:12] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
[2024-06-01 10:53:12] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:53:12] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2024-06-01 10:53:13] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:53:13] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:53:13] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 20/354 constraints. Problems are: Problem set: 1 solved, 317 unsolved
[2024-06-01 10:53:13] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 10:53:13] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-06-01 10:53:13] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-06-01 10:53:13] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-06-01 10:53:13] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-06-01 10:53:13] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:53:13] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-06-01 10:53:13] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 2 ms to minimize.
[2024-06-01 10:53:13] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:53:14] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-06-01 10:53:14] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-06-01 10:53:14] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-06-01 10:53:16] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:53:16] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:53:16] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:53:16] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:53:16] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 3 ms to minimize.
[2024-06-01 10:53:16] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:53:16] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:53:16] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 20/374 constraints. Problems are: Problem set: 1 solved, 317 unsolved
[2024-06-01 10:53:16] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
[2024-06-01 10:53:16] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-06-01 10:53:16] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:53:16] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-06-01 10:53:17] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:53:17] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:53:17] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:53:17] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:53:17] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 2 ms to minimize.
[2024-06-01 10:53:19] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:53:19] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:53:19] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:53:19] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:53:19] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:53:19] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:53:19] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:53:19] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:53:19] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:53:19] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-06-01 10:53:19] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 20/394 constraints. Problems are: Problem set: 1 solved, 317 unsolved
[2024-06-01 10:53:22] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-06-01 10:53:22] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:53:22] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-06-01 10:53:22] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-01 10:53:22] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-06-01 10:53:22] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:53:22] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:53:22] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:53:24] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-06-01 10:53:24] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-06-01 10:53:24] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-06-01 10:53:24] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-06-01 10:53:24] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 13/407 constraints. Problems are: Problem set: 1 solved, 317 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/569 variables, 0/407 constraints. Problems are: Problem set: 1 solved, 317 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 569/569 variables, and 407 constraints, problems are : Problem set: 1 solved, 317 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 292/292 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 93/93 constraints]
Escalating to Integer solving :Problem set: 1 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 8/292 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 93/108 constraints. Problems are: Problem set: 1 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 317 unsolved
At refinement iteration 5 (OVERLAPS) 277/569 variables, 292/400 constraints. Problems are: Problem set: 1 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 7/407 constraints. Problems are: Problem set: 1 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 317/724 constraints. Problems are: Problem set: 1 solved, 317 unsolved
[2024-06-01 10:53:39] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-06-01 10:53:39] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-06-01 10:53:39] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 10:53:39] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-01 10:53:39] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:53:39] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:53:40] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:53:40] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 8/732 constraints. Problems are: Problem set: 1 solved, 317 unsolved
[2024-06-01 10:53:48] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 1/733 constraints. Problems are: Problem set: 1 solved, 317 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 0/733 constraints. Problems are: Problem set: 1 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/569 variables, and 733 constraints, problems are : Problem set: 1 solved, 317 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 292/292 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 317/318 constraints, Known Traps: 102/102 constraints]
After SMT, in 60256ms problems are : Problem set: 1 solved, 317 unsolved
Search for dead transitions found 1 dead transitions in 60272ms
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 : 292/292 places, 325/326 transitions.
Applied a total of 0 rules in 5 ms. Remains 292 /292 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60719 ms. Remains : 292/292 places, 325/326 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-8-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Computed a total of 292 stabilizing places and 325 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 292 transition count 325
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 p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-8-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-8-LTLCardinality-08 finished in 61551 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)))'
Support contains 8 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 326/326 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 284 transition count 318
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 284 transition count 318
Applied a total of 16 rules in 13 ms. Remains 284 /292 variables (removed 8) and now considering 318/326 (removed 8) transitions.
[2024-06-01 10:54:00] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
// Phase 1: matrix 269 rows 284 cols
[2024-06-01 10:54:00] [INFO ] Computed 15 invariants in 10 ms
[2024-06-01 10:54:00] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-06-01 10:54:00] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
[2024-06-01 10:54:00] [INFO ] Invariant cache hit.
[2024-06-01 10:54:00] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 10:54:00] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2024-06-01 10:54:00] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
[2024-06-01 10:54:00] [INFO ] Invariant cache hit.
[2024-06-01 10:54:00] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 8/284 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Problem TDEAD20 is UNSAT
At refinement iteration 4 (OVERLAPS) 269/553 variables, 284/299 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 7/306 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-06-01 10:54:06] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 10:54:06] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:54:06] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-06-01 10:54:06] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-06-01 10:54:07] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-06-01 10:54:07] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:54:07] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:54:07] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:54:07] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:54:07] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:54:07] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:54:07] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:54:07] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:54:07] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:54:07] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-06-01 10:54:07] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:54:07] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:54:09] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:54:09] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:54:09] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 20/326 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-06-01 10:54:12] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-06-01 10:54:12] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-06-01 10:54:12] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-06-01 10:54:12] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 10:54:12] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:54:12] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:54:12] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-06-01 10:54:12] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:54:12] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:54:12] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:54:12] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:54:12] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-06-01 10:54:12] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 10:54:12] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-06-01 10:54:13] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-06-01 10:54:13] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-06-01 10:54:13] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 10:54:13] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:54:13] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:54:13] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 20/346 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-06-01 10:54:13] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-06-01 10:54:13] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-06-01 10:54:13] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 10:54:13] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 10:54:13] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-06-01 10:54:13] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-06-01 10:54:14] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:54:14] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:54:14] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-06-01 10:54:14] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-06-01 10:54:14] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 10:54:14] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-06-01 10:54:14] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:54:14] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:54:14] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-06-01 10:54:14] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
[2024-06-01 10:54:14] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:54:14] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-01 10:54:14] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:54:14] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/366 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:54:15] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:54:16] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:54:17] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-06-01 10:54:18] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-06-01 10:54:18] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-06-01 10:54:18] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 20/386 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-06-01 10:54:20] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-06-01 10:54:22] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-06-01 10:54:22] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-06-01 10:54:22] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 4/390 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-06-01 10:54:23] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 1/391 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/553 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 391 constraints, problems are : Problem set: 1 solved, 309 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 284/284 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 1 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 8/284 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 85/100 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 269/553 variables, 284/384 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 7/391 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 309/700 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/700 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 0/553 variables, 0/700 constraints. Problems are: Problem set: 1 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 700 constraints, problems are : Problem set: 1 solved, 309 unsolved in 24428 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 284/284 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 309/310 constraints, Known Traps: 85/85 constraints]
After SMT, in 54614ms problems are : Problem set: 1 solved, 309 unsolved
Search for dead transitions found 1 dead transitions in 54624ms
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 : 284/292 places, 317/326 transitions.
Applied a total of 0 rules in 11 ms. Remains 284 /284 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55005 ms. Remains : 284/292 places, 317/326 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-8-LTLCardinality-10
Product exploration explored 100000 steps with 1349 reset in 444 ms.
Product exploration explored 100000 steps with 1352 reset in 262 ms.
Computed a total of 284 stabilizing places and 317 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 284 transition count 317
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 288 steps (0 resets) in 13 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
[2024-06-01 10:54:56] [INFO ] Flow matrix only has 268 transitions (discarded 49 similar events)
// Phase 1: matrix 268 rows 284 cols
[2024-06-01 10:54:56] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 10:54:56] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 10:54:56] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-06-01 10:54:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:54:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 10:54:57] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-06-01 10:54:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 10:54:57] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2024-06-01 10:54:57] [INFO ] Computed and/alt/rep : 301/656/252 causal constraints (skipped 8 transitions) in 17 ms.
[2024-06-01 10:54:57] [INFO ] Added : 134 causal constraints over 27 iterations in 596 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 317/317 transitions.
Reduce places removed 8 places and 8 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 276 transition count 301
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 16 place count 268 transition count 301
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 112 place count 220 transition count 253
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 212 transition count 245
Applied a total of 120 rules in 54 ms. Remains 212 /284 variables (removed 72) and now considering 245/317 (removed 72) transitions.
[2024-06-01 10:54:57] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
// Phase 1: matrix 196 rows 212 cols
[2024-06-01 10:54:57] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 10:54:58] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 10:54:58] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2024-06-01 10:54:58] [INFO ] Invariant cache hit.
[2024-06-01 10:54:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 10:54:58] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-06-01 10:54:58] [INFO ] Redundant transitions in 9 ms returned []
Running 237 sub problems to find dead transitions.
[2024-06-01 10:54:58] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2024-06-01 10:54:58] [INFO ] Invariant cache hit.
[2024-06-01 10:54:58] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 196/408 variables, 212/228 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/408 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 234 constraints, problems are : Problem set: 0 solved, 237 unsolved in 7162 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 212/212 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 196/408 variables, 212/228 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 237/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 471 constraints, problems are : Problem set: 0 solved, 237 unsolved in 8460 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 212/212 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
After SMT, in 15770ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 15772ms
Starting structural reductions in SI_LTL mode, iteration 1 : 212/284 places, 245/317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16130 ms. Remains : 212/284 places, 245/317 transitions.
Computed a total of 212 stabilizing places and 245 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 212 transition count 245
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 : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 30 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-06-01 10:55:14] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2024-06-01 10:55:14] [INFO ] Invariant cache hit.
[2024-06-01 10:55:14] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 10:55:14] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-01 10:55:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:55:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 10:55:15] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-06-01 10:55:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 10:55:15] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2024-06-01 10:55:15] [INFO ] Computed and/alt/rep : 237/487/188 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 10:55:15] [INFO ] Added : 70 causal constraints over 14 iterations in 225 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19956 reset in 393 ms.
Product exploration explored 100000 steps with 19956 reset in 459 ms.
Support contains 8 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 245/245 transitions.
Applied a total of 0 rules in 8 ms. Remains 212 /212 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-01 10:55:16] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2024-06-01 10:55:16] [INFO ] Invariant cache hit.
[2024-06-01 10:55:16] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 10:55:16] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2024-06-01 10:55:16] [INFO ] Invariant cache hit.
[2024-06-01 10:55:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 10:55:16] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-06-01 10:55:16] [INFO ] Redundant transitions in 10 ms returned []
Running 237 sub problems to find dead transitions.
[2024-06-01 10:55:16] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2024-06-01 10:55:16] [INFO ] Invariant cache hit.
[2024-06-01 10:55:16] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 196/408 variables, 212/228 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/408 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 234 constraints, problems are : Problem set: 0 solved, 237 unsolved in 7237 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 212/212 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 196/408 variables, 212/228 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 237/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 471 constraints, problems are : Problem set: 0 solved, 237 unsolved in 8730 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 212/212 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
After SMT, in 16062ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 16066ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16371 ms. Remains : 212/212 places, 245/245 transitions.
Treatment of property NeoElection-COL-8-LTLCardinality-10 finished in 92415 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(p1)))'
Support contains 72 out of 292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 292/292 places, 326/326 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 292 transition count 318
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 16 place count 284 transition count 318
Applied a total of 16 rules in 27 ms. Remains 284 /292 variables (removed 8) and now considering 318/326 (removed 8) transitions.
[2024-06-01 10:55:32] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
// Phase 1: matrix 269 rows 284 cols
[2024-06-01 10:55:32] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 10:55:32] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 10:55:32] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
[2024-06-01 10:55:32] [INFO ] Invariant cache hit.
[2024-06-01 10:55:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 10:55:33] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-06-01 10:55:33] [INFO ] Redundant transitions in 8 ms returned []
Running 310 sub problems to find dead transitions.
[2024-06-01 10:55:33] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
[2024-06-01 10:55:33] [INFO ] Invariant cache hit.
[2024-06-01 10:55:33] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 8/284 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-01 10:55:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:55:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Problem TDEAD266 is UNSAT
At refinement iteration 5 (OVERLAPS) 269/553 variables, 284/301 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 7/308 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 0/308 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-06-01 10:55:43] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:55:43] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:55:43] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:55:43] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:55:43] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:55:43] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:55:43] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:55:45] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-06-01 10:55:45] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 10:55:45] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/553 variables, 10/318 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-06-01 10:55:46] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-06-01 10:55:46] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-06-01 10:55:46] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 3/321 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 11 (OVERLAPS) 0/553 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 321 constraints, problems are : Problem set: 1 solved, 309 unsolved in 22910 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 284/284 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 1 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 8/284 variables, 8/17 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 13/30 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 269/553 variables, 284/314 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 7/321 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 309/630 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-06-01 10:56:01] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:56:01] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:56:01] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:56:01] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:56:01] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:56:01] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:56:01] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:56:01] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:56:01] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:56:01] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:56:01] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:56:01] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:56:01] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:56:02] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:56:02] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:56:02] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:56:02] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:56:02] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:56:02] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:56:02] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 20/650 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-06-01 10:56:04] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:56:04] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-06-01 10:56:04] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:56:04] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:56:04] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:56:04] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:56:04] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:56:04] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 3 ms to minimize.
[2024-06-01 10:56:05] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-06-01 10:56:05] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-06-01 10:56:05] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-06-01 10:56:05] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-06-01 10:56:05] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 10:56:05] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 2 ms to minimize.
[2024-06-01 10:56:05] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 10:56:05] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-06-01 10:56:05] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-06-01 10:56:05] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-06-01 10:56:06] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-06-01 10:56:06] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 20/670 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-06-01 10:56:08] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:56:08] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:56:08] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:56:08] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:56:08] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:56:08] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 10:56:09] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:56:09] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:56:09] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:56:09] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:56:09] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-06-01 10:56:09] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:56:09] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:56:09] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 4 ms to minimize.
[2024-06-01 10:56:09] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-06-01 10:56:09] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:56:09] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:56:09] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:56:09] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:56:09] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 20/690 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-06-01 10:56:12] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:56:12] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:56:12] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:56:12] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:56:12] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:56:12] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:56:12] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:56:12] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:56:13] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:56:13] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:56:13] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:56:13] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:56:13] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:56:13] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:56:13] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-06-01 10:56:13] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:56:13] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-06-01 10:56:14] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-06-01 10:56:14] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:56:15] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/553 variables, 20/710 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-06-01 10:56:17] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:56:18] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:56:18] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-06-01 10:56:18] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:56:18] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 5/715 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 715 constraints, problems are : Problem set: 1 solved, 309 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 284/284 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 309/310 constraints, Known Traps: 100/100 constraints]
After SMT, in 53031ms problems are : Problem set: 1 solved, 309 unsolved
Search for dead transitions found 1 dead transitions in 53038ms
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 : 284/292 places, 317/326 transitions.
Applied a total of 0 rules in 9 ms. Remains 284 /284 variables (removed 0) and now considering 317/317 (removed 0) transitions.
[2024-06-01 10:56:26] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 53433 ms. Remains : 284/292 places, 317/326 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-COL-8-LTLCardinality-13
Product exploration explored 100000 steps with 31848 reset in 261 ms.
Product exploration explored 100000 steps with 31811 reset in 223 ms.
Computed a total of 284 stabilizing places and 317 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 284 transition count 317
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 (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 11 factoid took 307 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 11 factoid took 374 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
[2024-06-01 10:56:27] [INFO ] Flow matrix only has 268 transitions (discarded 49 similar events)
// Phase 1: matrix 268 rows 284 cols
[2024-06-01 10:56:27] [INFO ] Computed 16 invariants in 2 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 11 factoid took 477 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-8-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-8-LTLCardinality-13 finished in 55677 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)))'
Found a Shortening insensitive property : NeoElection-COL-8-LTLCardinality-10
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 8 out of 292 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 292/292 places, 326/326 transitions.
Reduce places removed 8 places and 8 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 284 transition count 310
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 16 place count 276 transition count 310
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 268 transition count 302
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 268 transition count 302
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 128 place count 220 transition count 254
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 136 place count 212 transition count 246
Applied a total of 136 rules in 30 ms. Remains 212 /292 variables (removed 80) and now considering 246/326 (removed 80) transitions.
[2024-06-01 10:56:28] [INFO ] Flow matrix only has 197 transitions (discarded 49 similar events)
// Phase 1: matrix 197 rows 212 cols
[2024-06-01 10:56:28] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 10:56:28] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 10:56:28] [INFO ] Flow matrix only has 197 transitions (discarded 49 similar events)
[2024-06-01 10:56:28] [INFO ] Invariant cache hit.
[2024-06-01 10:56:28] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 10:56:28] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-06-01 10:56:28] [INFO ] Flow matrix only has 197 transitions (discarded 49 similar events)
[2024-06-01 10:56:28] [INFO ] Invariant cache hit.
[2024-06-01 10:56:28] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 197/409 variables, 212/227 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 7/234 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/409 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 234 constraints, problems are : Problem set: 1 solved, 237 unsolved in 7255 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 212/212 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 197/409 variables, 212/227 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 7/234 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 237/471 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/471 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/409 variables, 0/471 constraints. Problems are: Problem set: 1 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 471 constraints, problems are : Problem set: 1 solved, 237 unsolved in 8635 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 212/212 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 237/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 15991ms problems are : Problem set: 1 solved, 237 unsolved
Search for dead transitions found 1 dead transitions in 15998ms
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 : 212/292 places, 245/326 transitions.
Applied a total of 0 rules in 12 ms. Remains 212 /212 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 16325 ms. Remains : 212/292 places, 245/326 transitions.
Running random walk in product with property : NeoElection-COL-8-LTLCardinality-10
Product exploration explored 100000 steps with 20022 reset in 382 ms.
Product exploration explored 100000 steps with 20045 reset in 425 ms.
Computed a total of 212 stabilizing places and 245 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 212 transition count 245
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 : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
[2024-06-01 10:56:46] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
// Phase 1: matrix 196 rows 212 cols
[2024-06-01 10:56:46] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 10:56:46] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2024-06-01 10:56:46] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-06-01 10:56:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:56:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 10:56:46] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-06-01 10:56:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 10:56:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:56:46] [INFO ] Computed and/alt/rep : 237/487/188 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 10:56:47] [INFO ] Added : 81 causal constraints over 17 iterations in 294 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 245/245 transitions.
Applied a total of 0 rules in 6 ms. Remains 212 /212 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-01 10:56:47] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2024-06-01 10:56:47] [INFO ] Invariant cache hit.
[2024-06-01 10:56:47] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 10:56:47] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2024-06-01 10:56:47] [INFO ] Invariant cache hit.
[2024-06-01 10:56:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 10:56:47] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-06-01 10:56:47] [INFO ] Redundant transitions in 1 ms returned []
Running 237 sub problems to find dead transitions.
[2024-06-01 10:56:47] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2024-06-01 10:56:47] [INFO ] Invariant cache hit.
[2024-06-01 10:56:47] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 196/408 variables, 212/228 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/408 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 234 constraints, problems are : Problem set: 0 solved, 237 unsolved in 7093 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 212/212 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 196/408 variables, 212/228 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 237/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 471 constraints, problems are : Problem set: 0 solved, 237 unsolved in 8710 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 212/212 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
After SMT, in 15904ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 15906ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16189 ms. Remains : 212/212 places, 245/245 transitions.
Computed a total of 212 stabilizing places and 245 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 212 transition count 245
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 : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-06-01 10:57:03] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2024-06-01 10:57:03] [INFO ] Invariant cache hit.
[2024-06-01 10:57:04] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 10:57:04] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-01 10:57:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:57:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 10:57:04] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-06-01 10:57:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 10:57:04] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2024-06-01 10:57:04] [INFO ] Computed and/alt/rep : 237/487/188 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 10:57:04] [INFO ] Added : 70 causal constraints over 14 iterations in 215 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20128 reset in 385 ms.
Product exploration explored 100000 steps with 19910 reset in 418 ms.
Support contains 8 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 245/245 transitions.
Applied a total of 0 rules in 5 ms. Remains 212 /212 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-01 10:57:05] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2024-06-01 10:57:05] [INFO ] Invariant cache hit.
[2024-06-01 10:57:05] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 10:57:05] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2024-06-01 10:57:05] [INFO ] Invariant cache hit.
[2024-06-01 10:57:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 10:57:05] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-06-01 10:57:05] [INFO ] Redundant transitions in 1 ms returned []
Running 237 sub problems to find dead transitions.
[2024-06-01 10:57:05] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2024-06-01 10:57:05] [INFO ] Invariant cache hit.
[2024-06-01 10:57:05] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 196/408 variables, 212/228 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/408 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 234 constraints, problems are : Problem set: 0 solved, 237 unsolved in 6926 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 212/212 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 196/408 variables, 212/228 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 237/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 471 constraints, problems are : Problem set: 0 solved, 237 unsolved in 8470 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 212/212 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
After SMT, in 15505ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 15507ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15791 ms. Remains : 212/212 places, 245/245 transitions.
Treatment of property NeoElection-COL-8-LTLCardinality-10 finished in 53039 ms.
[2024-06-01 10:57:21] [INFO ] Flatten gal took : 29 ms
[2024-06-01 10:57:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 10:57:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 292 places, 326 transitions and 1387 arcs took 5 ms.
Total runtime 265235 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA NeoElection-COL-8-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717239602748

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name NeoElection-COL-8-LTLCardinality-10
ltl formula formula --ltl=/tmp/1889/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 292 places, 326 transitions and 1387 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1889/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1889/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1889/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1889/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 294 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 293, there are 328 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~135 levels ~10000 states ~15992 transitions
pnml2lts-mc( 3/ 4): ~144 levels ~20000 states ~29640 transitions
pnml2lts-mc( 3/ 4): ~324 levels ~40000 states ~59524 transitions
pnml2lts-mc( 2/ 4): ~747 levels ~80000 states ~159628 transitions
pnml2lts-mc( 2/ 4): ~747 levels ~160000 states ~336776 transitions
pnml2lts-mc( 2/ 4): ~747 levels ~320000 states ~688500 transitions
pnml2lts-mc( 2/ 4): ~747 levels ~640000 states ~1476584 transitions
pnml2lts-mc( 2/ 4): ~747 levels ~1280000 states ~2944964 transitions
pnml2lts-mc( 2/ 4): ~747 levels ~2560000 states ~6057564 transitions
pnml2lts-mc( 2/ 4): ~747 levels ~5120000 states ~12096596 transitions
pnml2lts-mc( 2/ 4): ~747 levels ~10240000 states ~25117208 transitions
pnml2lts-mc( 2/ 4): ~747 levels ~20480000 states ~51182008 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33536878
pnml2lts-mc( 0/ 4): unique states count: 33539713
pnml2lts-mc( 0/ 4): unique transitions count: 83625552
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 50071137
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33539716
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2984
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33539716 states 83625579 transitions, fanout: 2.493
pnml2lts-mc( 0/ 4): Total exploration time 160.080 sec (160.060 sec minimum, 160.073 sec on average)
pnml2lts-mc( 0/ 4): States per second: 209518, Transitions per second: 522399
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 290.8MB, 9.1 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/54.0%
pnml2lts-mc( 0/ 4): Stored 329 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 290.8MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-8.tgz
mv NeoElection-COL-8 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 ;