Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876811900076.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is NeoElection-COL-6, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876811900076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 98K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NeoElection-COL-6-LTLFireability-00
FORMULA_NAME NeoElection-COL-6-LTLFireability-01
FORMULA_NAME NeoElection-COL-6-LTLFireability-02
FORMULA_NAME NeoElection-COL-6-LTLFireability-03
FORMULA_NAME NeoElection-COL-6-LTLFireability-04
FORMULA_NAME NeoElection-COL-6-LTLFireability-05
FORMULA_NAME NeoElection-COL-6-LTLFireability-06
FORMULA_NAME NeoElection-COL-6-LTLFireability-07
FORMULA_NAME NeoElection-COL-6-LTLFireability-08
FORMULA_NAME NeoElection-COL-6-LTLFireability-09
FORMULA_NAME NeoElection-COL-6-LTLFireability-10
FORMULA_NAME NeoElection-COL-6-LTLFireability-11
FORMULA_NAME NeoElection-COL-6-LTLFireability-12
FORMULA_NAME NeoElection-COL-6-LTLFireability-13
FORMULA_NAME NeoElection-COL-6-LTLFireability-14
FORMULA_NAME NeoElection-COL-6-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748797240723

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-01 17:00:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 17:00:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 17:00:42] [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.
[2025-06-01 17:00:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 17:00:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 600 ms
[2025-06-01 17:00:42] [INFO ] Detected 6 constant HL places corresponding to 2380 PT places.
[2025-06-01 17:00:42] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 4830 PT places and 13580.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2025-06-01 17:00:42] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2025-06-01 17:00:42] [INFO ] Skeletonized 11 HLPN properties in 1 ms. Removed 5 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-6-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Remains 8 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-6-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 168 steps (3 resets) in 12 ms. (12 steps per ms) remains 0/5 properties
[2025-06-01 17:00:42] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2025-06-01 17:00:42] [INFO ] Flatten gal took : 16 ms
FORMULA NeoElection-COL-6-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 17:00:42] [INFO ] Flatten gal took : 2 ms
Domain [M(7), POS(6), M(7)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 6)]] 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.
[2025-06-01 17:00:43] [INFO ] Unfolded HLPN to a Petri net with 4830 places and 7361 transitions 41792 arcs in 126 ms.
[2025-06-01 17:00:43] [INFO ] Unfolded 10 HLPN properties in 5 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4507 places in 21 ms
Reduce places removed 4543 places and 6967 transitions.
Reduce places removed 7 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-6-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 230 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 394/394 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 250 transition count 394
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 44 place count 236 transition count 340
Iterating global reduction 1 with 14 rules applied. Total rules applied 58 place count 236 transition count 340
Applied a total of 58 rules in 17 ms. Remains 236 /280 variables (removed 44) and now considering 340/394 (removed 54) transitions.
[2025-06-01 17:00:43] [INFO ] Flow matrix only has 315 transitions (discarded 25 similar events)
// Phase 1: matrix 315 rows 236 cols
[2025-06-01 17:00:43] [INFO ] Computed 47 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:00:43] [INFO ] Implicit Places using invariants in 209 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 235 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/280 places, 340/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 235 /235 variables (removed 0) and now considering 340/340 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 262 ms. Remains : 235/280 places, 340/394 transitions.
Support contains 230 out of 235 places after structural reductions.
[2025-06-01 17:00:43] [INFO ] Flatten gal took : 53 ms
[2025-06-01 17:00:43] [INFO ] Flatten gal took : 52 ms
[2025-06-01 17:00:43] [INFO ] Input system was already deterministic with 340 transitions.
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 435 steps (0 resets) in 146 ms. (2 steps per ms) remains 0/11 properties
Computed a total of 235 stabilizing places and 340 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 235 transition count 340
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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1) U p2) U X(X(p1))))'
Support contains 102 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 205 transition count 184
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 205 transition count 184
Applied a total of 60 rules in 8 ms. Remains 205 /235 variables (removed 30) and now considering 184/340 (removed 156) transitions.
[2025-06-01 17:00:44] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 205 cols
[2025-06-01 17:00:44] [INFO ] Computed 46 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:00:44] [INFO ] Implicit Places using invariants in 122 ms returned [17, 23, 29, 35, 41]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 124 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/235 places, 184/340 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 200/235 places, 184/340 transitions.
Stuttering acceptance computed with spot in 683 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-6-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-01 finished in 894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 86 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Reduce places removed 6 places and 6 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 223 transition count 334
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 6 place count 223 transition count 328
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 18 place count 217 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 211 transition count 322
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 211 transition count 322
Applied a total of 30 rules in 42 ms. Remains 211 /235 variables (removed 24) and now considering 322/340 (removed 18) transitions.
[2025-06-01 17:00:45] [INFO ] Flow matrix only has 297 transitions (discarded 25 similar events)
// Phase 1: matrix 297 rows 211 cols
[2025-06-01 17:00:45] [INFO ] Computed 40 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:00:45] [INFO ] Implicit Places using invariants in 105 ms returned [11, 13, 15, 17, 20, 22, 24, 26, 29, 31, 33, 35, 38, 40, 42, 44, 47, 49, 51, 53, 55, 56, 57, 58]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 107 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 187/235 places, 322/340 transitions.
Applied a total of 0 rules in 13 ms. Remains 187 /187 variables (removed 0) and now considering 322/322 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 162 ms. Remains : 187/235 places, 322/340 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-03
Product exploration explored 100000 steps with 1230 reset in 2318 ms.
Product exploration explored 100000 steps with 1228 reset in 2285 ms.
Computed a total of 187 stabilizing places and 322 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 187 transition count 322
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 148 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 244 steps (0 resets) in 31 ms. (7 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 11 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-6-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-6-LTLFireability-03 finished in 5469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((F(p1) U X(p2))||p0) U X(p3))))'
Support contains 58 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 205 transition count 184
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 205 transition count 184
Applied a total of 60 rules in 11 ms. Remains 205 /235 variables (removed 30) and now considering 184/340 (removed 156) transitions.
[2025-06-01 17:00:50] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 205 cols
[2025-06-01 17:00:50] [INFO ] Computed 46 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:00:50] [INFO ] Implicit Places using invariants in 136 ms returned [16, 17, 18, 19, 20, 21, 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]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 143 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/235 places, 184/340 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 170/235 places, 184/340 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-08
Product exploration explored 100000 steps with 6518 reset in 200 ms.
Product exploration explored 100000 steps with 6499 reset in 196 ms.
Computed a total of 170 stabilizing places and 184 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 170 transition count 184
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (AND (NOT p2) (NOT p3))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p3))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 135 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 7 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Reduction of identical properties reduced properties to check from 10 to 8
RANDOM walk for 40000 steps (96 resets) in 585 ms. (68 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 1/1 properties
[2025-06-01 17:00:52] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 170 cols
[2025-06-01 17:00:52] [INFO ] Computed 11 invariants in 1 ms
[2025-06-01 17:00:52] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
After SMT solving in domain Real declared 12/329 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 0/11 constraints, State Equation: 0/170 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (AND (NOT p2) (NOT p3))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p3)), (G (OR p0 p3)), (G (OR p0 p1 p3))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1))), (F p2), (F (NOT (AND (NOT p3) (NOT p2)))), (F p3), (F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 24 factoid took 414 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 58 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 184/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2025-06-01 17:00:53] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
[2025-06-01 17:00:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:00:53] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-01 17:00:53] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
[2025-06-01 17:00:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:00:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-01 17:00:53] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2025-06-01 17:00:53] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
[2025-06-01 17:00:53] [INFO ] Invariant cache hit.
[2025-06-01 17:00:53] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 6/170 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Problem TDEAD15 is UNSAT
At refinement iteration 4 (OVERLAPS) 159/329 variables, 170/181 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 5/186 constraints. Problems are: Problem set: 1 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:56] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:56] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:56] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:57] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:57] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:57] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:57] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:57] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:58] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:58] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:58] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:58] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:58] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:58] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:58] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:58] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:58] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:58] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:58] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:58] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 20/206 constraints. Problems are: Problem set: 1 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:59] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:59] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:59] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:59] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:59] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:59] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:59] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:59] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:59] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:00:59] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:00] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:00] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:00] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:00] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:00] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:00] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:00] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:00] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:00] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:00] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 20/226 constraints. Problems are: Problem set: 1 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:00] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:01] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:01] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:01] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:01] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:01] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:01] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:01] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:02] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:02] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:02] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:02] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:02] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:02] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:02] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:02] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 16/242 constraints. Problems are: Problem set: 1 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:02] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:03] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 2/244 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/244 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 0/329 variables, 0/244 constraints. Problems are: Problem set: 1 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 244 constraints, problems are : Problem set: 1 solved, 177 unsolved in 14334 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 170/170 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 6/170 variables, 6/13 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 56/69 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 159/329 variables, 170/239 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 5/244 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 177/421 constraints. Problems are: Problem set: 1 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:12] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 1/422 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/422 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 0/329 variables, 0/422 constraints. Problems are: Problem set: 1 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 422 constraints, problems are : Problem set: 1 solved, 177 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 170/170 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 177/178 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34441ms problems are : Problem set: 1 solved, 177 unsolved
Search for dead transitions found 1 dead transitions in 34443ms
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 : 170/170 places, 183/184 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34642 ms. Remains : 170/170 places, 183/184 transitions.
Computed a total of 170 stabilizing places and 183 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 170 transition count 183
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (AND (NOT p3) (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p3)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 107 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 132 steps (0 resets) in 8 ms. (14 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (AND (NOT p3) (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p3)), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3), (F p1)]
Knowledge based reduction with 13 factoid took 330 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 5808 reset in 183 ms.
Product exploration explored 100000 steps with 5813 reset in 190 ms.
Applying partial POR strategy [false, true, false, true, true, false]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 58 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 183/183 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 170 transition count 183
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 6 rules in 19 ms. Remains 170 /170 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:01:30] [INFO ] Redundant transitions in 7 ms returned []
Running 177 sub problems to find dead transitions.
[2025-06-01 17:01:30] [INFO ] Flow matrix only has 158 transitions (discarded 25 similar events)
// Phase 1: matrix 158 rows 170 cols
[2025-06-01 17:01:30] [INFO ] Computed 12 invariants in 1 ms
[2025-06-01 17:01:30] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 6/170 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:31] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:32] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
Problem TDEAD141 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:32] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:32] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:32] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:32] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 7/19 constraints. Problems are: Problem set: 6 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/19 constraints. Problems are: Problem set: 6 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 158/328 variables, 170/189 constraints. Problems are: Problem set: 6 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 4/193 constraints. Problems are: Problem set: 6 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:34] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:34] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:34] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:34] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:34] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:34] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:35] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:35] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:35] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:35] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:35] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:35] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:35] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:35] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:35] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:35] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:35] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:35] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:35] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:36] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 20/213 constraints. Problems are: Problem set: 6 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:36] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:36] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:36] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:36] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:36] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:36] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:36] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:36] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:36] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:36] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:37] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:37] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:37] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:37] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:37] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 15/228 constraints. Problems are: Problem set: 6 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:37] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:37] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:38] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:38] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:38] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:38] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 6/234 constraints. Problems are: Problem set: 6 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:39] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:39] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:01:39] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 3/237 constraints. Problems are: Problem set: 6 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/237 constraints. Problems are: Problem set: 6 solved, 171 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/237 constraints. Problems are: Problem set: 6 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 237 constraints, problems are : Problem set: 6 solved, 171 unsolved in 14404 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 170/170 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 171 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 12/170 variables, 7/12 constraints. Problems are: Problem set: 6 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 51/63 constraints. Problems are: Problem set: 6 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/63 constraints. Problems are: Problem set: 6 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 158/328 variables, 170/233 constraints. Problems are: Problem set: 6 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 4/237 constraints. Problems are: Problem set: 6 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 171/408 constraints. Problems are: Problem set: 6 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/408 constraints. Problems are: Problem set: 6 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/328 variables, 0/408 constraints. Problems are: Problem set: 6 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 408 constraints, problems are : Problem set: 6 solved, 171 unsolved in 12797 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 170/170 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 171/177 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27232ms problems are : Problem set: 6 solved, 171 unsolved
Search for dead transitions found 6 dead transitions in 27234ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 170/170 places, 177/183 transitions.
Graph (complete) has 504 edges and 170 vertex of which 164 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 164 /170 variables (removed 6) and now considering 177/177 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 164/170 places, 177/183 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27290 ms. Remains : 164/170 places, 177/183 transitions.
Built C files in :
/tmp/ltsmin11016951650409187998
[2025-06-01 17:01:57] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11016951650409187998
Running compilation step : cd /tmp/ltsmin11016951650409187998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 467 ms.
Running link step : cd /tmp/ltsmin11016951650409187998;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11016951650409187998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11637274372285092524.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 58 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 183/183 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2025-06-01 17:02:12] [INFO ] Flow matrix only has 158 transitions (discarded 25 similar events)
// Phase 1: matrix 158 rows 170 cols
[2025-06-01 17:02:12] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:02:12] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-01 17:02:12] [INFO ] Flow matrix only has 158 transitions (discarded 25 similar events)
[2025-06-01 17:02:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:02:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 17:02:12] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-06-01 17:02:12] [INFO ] Flow matrix only has 158 transitions (discarded 25 similar events)
[2025-06-01 17:02:12] [INFO ] Invariant cache hit.
[2025-06-01 17:02:12] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 6/170 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:14] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:14] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 158/328 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:17] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:17] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:17] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:17] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:17] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:17] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:17] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:17] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:18] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:18] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:18] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:18] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:18] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:18] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:18] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:18] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:18] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:18] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:18] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:18] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:19] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:19] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:19] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:19] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:19] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:19] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:19] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:19] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:19] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:19] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:19] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:19] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:20] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:20] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 14/222 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:20] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:20] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:20] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:20] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:20] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:20] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:20] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:20] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 8/230 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:22] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:22] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:22] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:22] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:22] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:23] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:23] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:23] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:24] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:24] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:24] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:27] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/328 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 16 (OVERLAPS) 0/328 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 242 constraints, problems are : Problem set: 0 solved, 177 unsolved in 19126 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 170/170 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 6/170 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 158/328 variables, 170/238 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 177/419 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:02:40] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/328 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 0/328 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 420 constraints, problems are : Problem set: 0 solved, 177 unsolved in 28161 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 170/170 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47321ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 47325ms
Finished structural reductions in LTL mode , in 1 iterations and 47490 ms. Remains : 170/170 places, 183/183 transitions.
Built C files in :
/tmp/ltsmin2397864527973385863
[2025-06-01 17:03:00] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2397864527973385863
Running compilation step : cd /tmp/ltsmin2397864527973385863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 315 ms.
Running link step : cd /tmp/ltsmin2397864527973385863;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2397864527973385863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1328059275392875247.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 17:03:15] [INFO ] Flatten gal took : 17 ms
[2025-06-01 17:03:15] [INFO ] Flatten gal took : 11 ms
[2025-06-01 17:03:15] [INFO ] Time to serialize gal into /tmp/LTL9044792794673679124.gal : 3 ms
[2025-06-01 17:03:15] [INFO ] Time to serialize properties into /tmp/LTL7305988216629763117.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9044792794673679124.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2286910475948837247.hoa' '-atoms' '/tmp/LTL7305988216629763117.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7305988216629763117.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2286910475948837247.hoa
Detected timeout of ITS tools.
[2025-06-01 17:03:30] [INFO ] Flatten gal took : 11 ms
[2025-06-01 17:03:30] [INFO ] Flatten gal took : 10 ms
[2025-06-01 17:03:30] [INFO ] Time to serialize gal into /tmp/LTL16430504044899611535.gal : 2 ms
[2025-06-01 17:03:30] [INFO ] Time to serialize properties into /tmp/LTL14396289493459772180.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16430504044899611535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14396289493459772180.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((("(((P_electionInit_1>=1)||(P_electionInit_2>=1))||((P_electionInit_4>=1)||(P_electionInit_3>=1)))")||(("((P_electionInit_6>=1)|...5026
Formula 0 simplified : F((!"(((P_electionInit_1>=1)||(P_electionInit_2>=1))||((P_electionInit_4>=1)||(P_electionInit_3>=1)))" & !"((P_electionInit_6>=1)||(...5016
Detected timeout of ITS tools.
[2025-06-01 17:03:45] [INFO ] Flatten gal took : 14 ms
[2025-06-01 17:03:45] [INFO ] Applying decomposition
[2025-06-01 17:03:45] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16206914628374618092.txt' '-o' '/tmp/graph16206914628374618092.bin' '-w' '/tmp/graph16206914628374618092.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16206914628374618092.bin' '-l' '-1' '-v' '-w' '/tmp/graph16206914628374618092.weights' '-q' '0' '-e' '0.001'
[2025-06-01 17:03:45] [INFO ] Decomposing Gal with order
[2025-06-01 17:03:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 17:03:45] [INFO ] Removed a total of 33 redundant transitions.
[2025-06-01 17:03:45] [INFO ] Flatten gal took : 34 ms
[2025-06-01 17:03:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2025-06-01 17:03:45] [INFO ] Time to serialize gal into /tmp/LTL8653217843212227609.gal : 3 ms
[2025-06-01 17:03:45] [INFO ] Time to serialize properties into /tmp/LTL8228585104289990253.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8653217843212227609.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8228585104289990253.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((("(((i5.u0.P_electionInit_1>=1)||(i6.u15.P_electionInit_2>=1))||((i1.u1.P_electionInit_4>=1)||(i7.u18.P_electionInit_3>=1)))")||...5734
Formula 0 simplified : F((!"(((i5.u0.P_electionInit_1>=1)||(i6.u15.P_electionInit_2>=1))||((i1.u1.P_electionInit_4>=1)||(i7.u18.P_electionInit_3>=1)))" & !...5724
Detected timeout of ITS tools.
Treatment of property NeoElection-COL-6-LTLFireability-08 finished in 190224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 55 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 229 transition count 334
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 334
Applied a total of 12 rules in 7 ms. Remains 229 /235 variables (removed 6) and now considering 334/340 (removed 6) transitions.
[2025-06-01 17:04:00] [INFO ] Flow matrix only has 309 transitions (discarded 25 similar events)
// Phase 1: matrix 309 rows 229 cols
[2025-06-01 17:04:00] [INFO ] Computed 46 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:04:00] [INFO ] Implicit Places using invariants in 142 ms returned [16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 67, 68, 69, 70]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 143 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/235 places, 334/340 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 154 ms. Remains : 199/235 places, 334/340 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 469 ms.
Product exploration explored 100000 steps with 33333 reset in 459 ms.
Computed a total of 199 stabilizing places and 334 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 199 transition count 334
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-6-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-6-LTLFireability-12 finished in 1314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||(!p0&&X((p0 U (p1||G(p0)))))))))'
Support contains 61 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 229 transition count 334
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 334
Applied a total of 12 rules in 9 ms. Remains 229 /235 variables (removed 6) and now considering 334/340 (removed 6) transitions.
[2025-06-01 17:04:02] [INFO ] Flow matrix only has 309 transitions (discarded 25 similar events)
[2025-06-01 17:04:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:04:02] [INFO ] Implicit Places using invariants in 113 ms returned [16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 67, 68, 69, 70]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 115 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/235 places, 334/340 transitions.
Applied a total of 0 rules in 2 ms. Remains 199 /199 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 199/235 places, 334/340 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-13
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-6-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-13 finished in 310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p1)||p0) U (X((!p2&&X(!p3))) U (X(G((!p2&&X(!p3))))||(!p2&&X((!p2&&X(!p3))))))))'
Support contains 82 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 199 transition count 178
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 199 transition count 178
Applied a total of 72 rules in 8 ms. Remains 199 /235 variables (removed 36) and now considering 178/340 (removed 162) transitions.
[2025-06-01 17:04:02] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 199 cols
[2025-06-01 17:04:02] [INFO ] Computed 46 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:04:02] [INFO ] Implicit Places using invariants in 95 ms returned [16, 17, 18, 19, 20, 21, 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]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 96 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/235 places, 178/340 transitions.
Applied a total of 0 rules in 1 ms. Remains 164 /164 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 164/235 places, 178/340 transitions.
Stuttering acceptance computed with spot in 547 ms :[(OR p2 p3), (OR (AND (NOT p1) p2) (AND (NOT p1) p3)), (AND p2 (NOT p3)), (OR p2 p3), (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3)), (OR p3 p2), true, p3, (NOT p1), (AND (NOT p1) p3), p3, (AND (NOT p1) p3), p3]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-14
Product exploration explored 100000 steps with 37526 reset in 1762 ms.
Product exploration explored 100000 steps with 37489 reset in 1766 ms.
Computed a total of 164 stabilizing places and 178 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 178
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p0) p1 p3))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p0) (NOT p1) (NOT p3)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1) p3))), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X (NOT (OR (AND p2 p0 (NOT p3)) (AND p2 p1 (NOT p3))))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND p2 (NOT p0) p1 p3))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p0) p1 (NOT p3)))), (X (NOT (AND p0 p1))), (X (AND (NOT p2) (NOT p0) p1 (NOT p3))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p1 p3)))), (X (NOT p0)), (X (NOT (OR (AND p2 p0 p3) (AND p2 p1 p3)))), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 p3)))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 p1 p3)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p2 p0 (NOT p3)) (AND p2 p1 (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) (NOT p0) p1 (NOT p3)))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p1 p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p2 p0 p3) (AND p2 p1 p3))))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p3)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 73 factoid took 129 ms. Reduced automaton from 13 states, 47 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-6-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-6-LTLFireability-14 finished in 4421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((F(p1) U X(p2))||p0) U X(p3))))'
Found a Lengthening insensitive property : NeoElection-COL-6-LTLFireability-08
Stuttering acceptance computed with spot in 321 ms :[(NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 58 out of 235 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 205 transition count 184
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 205 transition count 184
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 199 transition count 178
Applied a total of 72 rules in 19 ms. Remains 199 /235 variables (removed 36) and now considering 178/340 (removed 162) transitions.
[2025-06-01 17:04:07] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 199 cols
[2025-06-01 17:04:07] [INFO ] Computed 46 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:04:07] [INFO ] Implicit Places using invariants in 100 ms returned [16, 17, 18, 19, 20, 21, 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]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 101 ms to find 35 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 164/235 places, 178/340 transitions.
Applied a total of 0 rules in 9 ms. Remains 164 /164 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 129 ms. Remains : 164/235 places, 178/340 transitions.
Running random walk in product with property : NeoElection-COL-6-LTLFireability-08
Product exploration explored 100000 steps with 6623 reset in 176 ms.
Product exploration explored 100000 steps with 6592 reset in 188 ms.
Computed a total of 164 stabilizing places and 178 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 178
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (AND (NOT p2) (NOT p3))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p3))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 138 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 7 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Reduction of identical properties reduced properties to check from 10 to 8
RANDOM walk for 40000 steps (96 resets) in 191 ms. (208 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
[2025-06-01 17:04:08] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 164 cols
[2025-06-01 17:04:08] [INFO ] Computed 11 invariants in 1 ms
[2025-06-01 17:04:08] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
After SMT solving in domain Real declared 12/317 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 13 ms.
Refiners :[Positive P Invariants (semi-flows): 0/11 constraints, State Equation: 0/164 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (AND (NOT p2) (NOT p3))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p3)), (G (OR p0 p3)), (G (OR p0 p1 p3))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1))), (F p2), (F (NOT (AND (NOT p3) (NOT p2)))), (F p3), (F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 24 factoid took 426 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 58 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2025-06-01 17:04:09] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2025-06-01 17:04:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:04:09] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-01 17:04:09] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2025-06-01 17:04:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:04:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-01 17:04:09] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2025-06-01 17:04:09] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2025-06-01 17:04:09] [INFO ] Invariant cache hit.
[2025-06-01 17:04:09] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Problem TDEAD15 is UNSAT
At refinement iteration 4 (OVERLAPS) 153/317 variables, 164/175 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 5/180 constraints. Problems are: Problem set: 1 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:12] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:12] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:12] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:12] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:12] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:12] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:12] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:12] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:12] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:13] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:13] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:13] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:13] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:13] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:13] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:13] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:13] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:14] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:14] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:14] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/200 constraints. Problems are: Problem set: 1 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:14] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:15] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:16] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/220 constraints. Problems are: Problem set: 1 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:16] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:16] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 2/222 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 222 constraints, problems are : Problem set: 1 solved, 171 unsolved in 12036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 171 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 42/53 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 153/317 variables, 164/217 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 5/222 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 171/393 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/393 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/393 constraints. Problems are: Problem set: 1 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 393 constraints, problems are : Problem set: 1 solved, 171 unsolved in 13147 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 171/172 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25210ms problems are : Problem set: 1 solved, 171 unsolved
Search for dead transitions found 1 dead transitions in 25211ms
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 : 164/164 places, 177/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25384 ms. Remains : 164/164 places, 177/178 transitions.
Computed a total of 164 stabilizing places and 177 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 177
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (AND (NOT p3) (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p3)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 126 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 107 steps (0 resets) in 9 ms. (10 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (AND (NOT p3) (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p3)), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3), (F p1)]
Knowledge based reduction with 13 factoid took 375 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 5777 reset in 195 ms.
Product exploration explored 100000 steps with 5754 reset in 194 ms.
Applying partial POR strategy [false, true, false, true, true, false]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 58 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 177/177 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:04:37] [INFO ] Redundant transitions in 6 ms returned []
Running 171 sub problems to find dead transitions.
[2025-06-01 17:04:37] [INFO ] Flow matrix only has 152 transitions (discarded 25 similar events)
// Phase 1: matrix 152 rows 164 cols
[2025-06-01 17:04:37] [INFO ] Computed 12 invariants in 1 ms
[2025-06-01 17:04:37] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:38] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 152/316 variables, 164/177 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:41] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:41] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:41] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:41] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:41] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:41] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:41] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:41] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:41] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:41] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:41] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:41] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:41] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:41] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:42] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:42] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:42] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:42] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:42] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:42] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:42] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:42] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:43] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:43] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:43] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:43] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:43] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:43] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:44] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:44] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:44] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:44] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:44] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:44] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:44] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 15/216 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:44] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:44] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:44] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:44] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:46] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:46] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:04:46] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (OVERLAPS) 0/316 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 223 constraints, problems are : Problem set: 0 solved, 171 unsolved in 13818 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 164/164 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 152/316 variables, 164/219 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 171/394 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/316 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 394 constraints, problems are : Problem set: 0 solved, 171 unsolved in 13466 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 164/164 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27308ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 27308ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27331 ms. Remains : 164/164 places, 177/177 transitions.
Built C files in :
/tmp/ltsmin5290631256245666546
[2025-06-01 17:05:04] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5290631256245666546
Running compilation step : cd /tmp/ltsmin5290631256245666546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 327 ms.
Running link step : cd /tmp/ltsmin5290631256245666546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5290631256245666546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14235604411654866271.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 58 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 177/177 transitions.
Applied a total of 0 rules in 9 ms. Remains 164 /164 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2025-06-01 17:05:19] [INFO ] Flow matrix only has 152 transitions (discarded 25 similar events)
[2025-06-01 17:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:05:19] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-01 17:05:19] [INFO ] Flow matrix only has 152 transitions (discarded 25 similar events)
[2025-06-01 17:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:05:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 17:05:19] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2025-06-01 17:05:19] [INFO ] Flow matrix only has 152 transitions (discarded 25 similar events)
[2025-06-01 17:05:19] [INFO ] Invariant cache hit.
[2025-06-01 17:05:19] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 152/316 variables, 164/176 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:22] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:22] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:22] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:22] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:22] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:22] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:22] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:23] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:23] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:23] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:23] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:23] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:23] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:23] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:23] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:24] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:24] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:24] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:24] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:24] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:25] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:25] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:25] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:25] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:25] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:25] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:25] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:25] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:25] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:25] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:25] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:26] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:26] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:26] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:26] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 15/215 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:26] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:26] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:26] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:26] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:26] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:26] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 6/221 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:27] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:27] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:27] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:27] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (OVERLAPS) 0/316 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 225 constraints, problems are : Problem set: 0 solved, 171 unsolved in 12366 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 164/164 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 152/316 variables, 164/221 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 171/396 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:35] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:05:35] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 2/398 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (OVERLAPS) 0/316 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 398 constraints, problems are : Problem set: 0 solved, 171 unsolved in 17309 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 164/164 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29695ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 29696ms
Finished structural reductions in LTL mode , in 1 iterations and 29852 ms. Remains : 164/164 places, 177/177 transitions.
Built C files in :
/tmp/ltsmin11092997821956733882
[2025-06-01 17:05:49] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11092997821956733882
Running compilation step : cd /tmp/ltsmin11092997821956733882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 308 ms.
Running link step : cd /tmp/ltsmin11092997821956733882;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11092997821956733882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17183614092359124557.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 17:06:04] [INFO ] Flatten gal took : 17 ms
[2025-06-01 17:06:04] [INFO ] Flatten gal took : 10 ms
[2025-06-01 17:06:04] [INFO ] Time to serialize gal into /tmp/LTL701321762602594135.gal : 2 ms
[2025-06-01 17:06:04] [INFO ] Time to serialize properties into /tmp/LTL3737610755507552734.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL701321762602594135.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12046907544333616109.hoa' '-atoms' '/tmp/LTL3737610755507552734.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3737610755507552734.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12046907544333616109.hoa
Detected timeout of ITS tools.
[2025-06-01 17:06:19] [INFO ] Flatten gal took : 9 ms
[2025-06-01 17:06:19] [INFO ] Flatten gal took : 14 ms
[2025-06-01 17:06:19] [INFO ] Time to serialize gal into /tmp/LTL7903402720001833958.gal : 1 ms
[2025-06-01 17:06:19] [INFO ] Time to serialize properties into /tmp/LTL14918454462573347210.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7903402720001833958.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14918454462573347210.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((("(((P_electionInit_1>=1)||(P_electionInit_2>=1))||((P_electionInit_4>=1)||(P_electionInit_3>=1)))")||(("((P_electionInit_6>=1)|...5026
Formula 0 simplified : F((!"(((P_electionInit_1>=1)||(P_electionInit_2>=1))||((P_electionInit_4>=1)||(P_electionInit_3>=1)))" & !"((P_electionInit_6>=1)||(...5016
Detected timeout of ITS tools.
[2025-06-01 17:06:34] [INFO ] Flatten gal took : 15 ms
[2025-06-01 17:06:34] [INFO ] Applying decomposition
[2025-06-01 17:06:34] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11045847513373061294.txt' '-o' '/tmp/graph11045847513373061294.bin' '-w' '/tmp/graph11045847513373061294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11045847513373061294.bin' '-l' '-1' '-v' '-w' '/tmp/graph11045847513373061294.weights' '-q' '0' '-e' '0.001'
[2025-06-01 17:06:34] [INFO ] Decomposing Gal with order
[2025-06-01 17:06:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 17:06:34] [INFO ] Removed a total of 35 redundant transitions.
[2025-06-01 17:06:34] [INFO ] Flatten gal took : 35 ms
[2025-06-01 17:06:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2025-06-01 17:06:34] [INFO ] Time to serialize gal into /tmp/LTL1778054189793190593.gal : 7 ms
[2025-06-01 17:06:34] [INFO ] Time to serialize properties into /tmp/LTL14583801534733289805.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1778054189793190593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14583801534733289805.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((("(((i7.u14.P_electionInit_1>=1)||(i8.u16.P_electionInit_2>=1))||((i0.u1.P_electionInit_4>=1)||(i10.u0.P_electionInit_3>=1)))")|...5764
Formula 0 simplified : F((!"(((i7.u14.P_electionInit_1>=1)||(i8.u16.P_electionInit_2>=1))||((i0.u1.P_electionInit_4>=1)||(i10.u0.P_electionInit_3>=1)))" & ...5754
Detected timeout of ITS tools.
Treatment of property NeoElection-COL-6-LTLFireability-08 finished in 163141 ms.
[2025-06-01 17:06:49] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10253535837902725131
[2025-06-01 17:06:50] [INFO ] Applying decomposition
[2025-06-01 17:06:50] [INFO ] Computing symmetric may disable matrix : 340 transitions.
[2025-06-01 17:06:50] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:06:50] [INFO ] Computing symmetric may enable matrix : 340 transitions.
[2025-06-01 17:06:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:06:50] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17867765562583336564.txt' '-o' '/tmp/graph17867765562583336564.bin' '-w' '/tmp/graph17867765562583336564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17867765562583336564.bin' '-l' '-1' '-v' '-w' '/tmp/graph17867765562583336564.weights' '-q' '0' '-e' '0.001'
[2025-06-01 17:06:50] [INFO ] Decomposing Gal with order
[2025-06-01 17:06:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 17:06:50] [INFO ] Computing Do-Not-Accords matrix : 340 transitions.
[2025-06-01 17:06:50] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:06:50] [INFO ] Removed a total of 29 redundant transitions.
[2025-06-01 17:06:50] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10253535837902725131
Running compilation step : cd /tmp/ltsmin10253535837902725131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-01 17:06:50] [INFO ] Flatten gal took : 31 ms
[2025-06-01 17:06:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 3 ms.
[2025-06-01 17:06:50] [INFO ] Time to serialize gal into /tmp/LTLFireability11506462910742361969.gal : 4 ms
[2025-06-01 17:06:50] [INFO ] Time to serialize properties into /tmp/LTLFireability17837943335547569808.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11506462910742361969.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17837943335547569808.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G((("(((u0.P_electionInit_1>=1)||(u16.P_electionInit_2>=1))||((u2.P_electionInit_4>=1)||(u1.P_electionInit_3>=1)))")||(("((i4.u3.P_...6180
Formula 0 simplified : F((!"(((u0.P_electionInit_1>=1)||(u16.P_electionInit_2>=1))||((u2.P_electionInit_4>=1)||(u1.P_electionInit_3>=1)))" & !"((i4.u3.P_el...6170
Compilation finished in 808 ms.
Running link step : cd /tmp/ltsmin10253535837902725131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10253535837902725131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((<>((LTLAPp1==true)) U X((LTLAPp2==true)))||(LTLAPp0==true)) U X((LTLAPp3==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: LTL layer: formula: []((((<>((LTLAPp1==true)) U X((LTLAPp2==true)))||(LTLAPp0==true)) U X((LTLAPp3==true))))
pins2lts-mc-linux64( 4/ 8), 0.019: "[]((((<>((LTLAPp1==true)) U X((LTLAPp2==true)))||(LTLAPp0==true)) U X((LTLAPp3==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.019: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.042: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.110: DFS-FIFO for weak LTL, using special progress label 345
pins2lts-mc-linux64( 0/ 8), 0.110: There are 346 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.110: State length is 236, there are 354 groups
pins2lts-mc-linux64( 0/ 8), 0.110: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.110: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.110: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.110: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.151: ~41 levels ~960 states ~2896 transitions
pins2lts-mc-linux64( 4/ 8), 0.161: ~41 levels ~1920 states ~3632 transitions
pins2lts-mc-linux64( 2/ 8), 0.187: ~42 levels ~3840 states ~5752 transitions
pins2lts-mc-linux64( 2/ 8), 0.228: ~42 levels ~7680 states ~10624 transitions
pins2lts-mc-linux64( 2/ 8), 0.324: ~42 levels ~15360 states ~21544 transitions
pins2lts-mc-linux64( 6/ 8), 0.524: ~40 levels ~30720 states ~40880 transitions
pins2lts-mc-linux64( 2/ 8), 0.827: ~42 levels ~61440 states ~95152 transitions
pins2lts-mc-linux64( 2/ 8), 1.280: ~42 levels ~122880 states ~204944 transitions
pins2lts-mc-linux64( 4/ 8), 2.454: ~42 levels ~245760 states ~450520 transitions
pins2lts-mc-linux64( 4/ 8), 4.309: ~42 levels ~491520 states ~868720 transitions
pins2lts-mc-linux64( 2/ 8), 7.815: ~42 levels ~983040 states ~2095272 transitions
pins2lts-mc-linux64( 3/ 8), 13.775: ~42 levels ~1966080 states ~4102496 transitions
pins2lts-mc-linux64( 4/ 8), 25.944: ~42 levels ~3932160 states ~8213400 transitions
pins2lts-mc-linux64( 4/ 8), 49.434: ~42 levels ~7864320 states ~16301552 transitions
pins2lts-mc-linux64( 4/ 8), 96.352: ~42 levels ~15728640 states ~30845608 transitions
pins2lts-mc-linux64( 3/ 8), 193.224: ~42 levels ~31457280 states ~62866080 transitions
pins2lts-mc-linux64( 4/ 8), 377.024: ~42 levels ~62914560 states ~117664432 transitions
pins2lts-mc-linux64( 3/ 8), 755.582: ~42 levels ~125829120 states ~247236464 transitions
pins2lts-mc-linux64( 4/ 8), 844.388: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 844.447:
pins2lts-mc-linux64( 0/ 8), 844.447: mean standard work distribution: 7.6% (states) 15.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 844.447:
pins2lts-mc-linux64( 0/ 8), 844.447: Explored 130307002 states 306080645 transitions, fanout: 2.349
pins2lts-mc-linux64( 0/ 8), 844.447: Total exploration time 844.330 sec (844.270 sec minimum, 844.289 sec on average)
pins2lts-mc-linux64( 0/ 8), 844.447: States per second: 154332, Transitions per second: 362513
pins2lts-mc-linux64( 0/ 8), 844.447:
pins2lts-mc-linux64( 0/ 8), 844.447: Progress states detected: 14191786
pins2lts-mc-linux64( 0/ 8), 844.447: Redundant explorations: -2.9134
pins2lts-mc-linux64( 0/ 8), 844.447:
pins2lts-mc-linux64( 0/ 8), 844.447: Queue width: 8B, total height: 7019483, memory: 53.55MB
pins2lts-mc-linux64( 0/ 8), 844.447: Tree memory: 1273.0MB, 9.9 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 844.447: Tree fill ratio (roots/leafs): 99.0%/97.0%
pins2lts-mc-linux64( 0/ 8), 844.447: Stored 350 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 844.447: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 844.447: Est. total memory use: 1326.6MB (~1077.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10253535837902725131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((<>((LTLAPp1==true)) U X((LTLAPp2==true)))||(LTLAPp0==true)) U X((LTLAPp3==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10253535837902725131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((<>((LTLAPp1==true)) U X((LTLAPp2==true)))||(LTLAPp0==true)) U X((LTLAPp3==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-01 17:28:52] [INFO ] Applying decomposition
[2025-06-01 17:28:52] [INFO ] Flatten gal took : 17 ms
[2025-06-01 17:28:52] [INFO ] Decomposing Gal with order
[2025-06-01 17:28:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 17:28:52] [INFO ] Removed a total of 891 redundant transitions.
[2025-06-01 17:28:52] [INFO ] Flatten gal took : 62 ms
[2025-06-01 17:28:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-01 17:28:52] [INFO ] Time to serialize gal into /tmp/LTLFireability10034607017038391617.gal : 4 ms
[2025-06-01 17:28:52] [INFO ] Time to serialize properties into /tmp/LTLFireability7160501915412086761.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10034607017038391617.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7160501915412086761.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((("(((M1.P_electionInit_1>=1)||(M2.P_electionInit_2>=1))||((M4.P_electionInit_4>=1)||(M3.P_electionInit_3>=1)))")||(("((M6.P_elec...6239
Formula 0 simplified : F((!"(((M1.P_electionInit_1>=1)||(M2.P_electionInit_2>=1))||((M4.P_electionInit_4>=1)||(M3.P_electionInit_3>=1)))" & !"((M6.P_electi...6229
Detected timeout of ITS tools.
[2025-06-01 17:50:56] [INFO ] Flatten gal took : 387 ms
[2025-06-01 17:50:57] [INFO ] Input system was already deterministic with 340 transitions.
[2025-06-01 17:50:57] [INFO ] Transformed 235 places.
[2025-06-01 17:50:57] [INFO ] Transformed 340 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-01 17:50:58] [INFO ] Time to serialize gal into /tmp/LTLFireability7370904423618004393.gal : 53 ms
[2025-06-01 17:50:58] [INFO ] Time to serialize properties into /tmp/LTLFireability2841618783428620231.ltl : 21 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7370904423618004393.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2841618783428620231.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((("(((P_electionInit_1>=1)||(P_electionInit_2>=1))||((P_electionInit_4>=1)||(P_electionInit_3>=1)))")||(("((P_electionInit_6>=1)|...5026
Formula 0 simplified : F((!"(((P_electionInit_1>=1)||(P_electionInit_2>=1))||((P_electionInit_4>=1)||(P_electionInit_3>=1)))" & !"((P_electionInit_6>=1)||(...5016

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-COL-6"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-6, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876811900076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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