Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r170-smll-174889233400154.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 Referendum-COL-0200, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-174889233400154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 14K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 11K 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 Referendum-COL-0200-CTLFireability-2025-00
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-01
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-02
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-03
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-04
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-05
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-06
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-07
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-08
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-09
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-10
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-11
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-12
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-13
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-14
FORMULA_NAME Referendum-COL-0200-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748972593596

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-COL-0200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202505121319
[2025-06-03 17:43:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 17:43:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 17:43:16] [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-03 17:43:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 17:43:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 953 ms
[2025-06-03 17:43:17] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 601 PT places and 401.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
[2025-06-03 17:43:17] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 12 ms.
[2025-06-03 17:43:17] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 6 formulas.
FORMULA Referendum-COL-0200-CTLFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 4 steps (0 resets) in 7 ms. (0 steps per ms) remains 0/1 properties
[2025-06-03 17:43:17] [INFO ] Flatten gal took : 21 ms
[2025-06-03 17:43:17] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [0:1*[0]] contains constants of sort Voters
Arc [0:1*[1]] contains constants of sort Voters
Arc [0:1*[2]] contains constants of sort Voters
Arc [0:1*[3]] contains constants of sort Voters
Arc [0:1*[4]] contains constants of sort Voters
Arc [0:1*[5]] contains constants of sort Voters
Arc [0:1*[6]] contains constants of sort Voters
Arc [0:1*[7]] contains constants of sort Voters
Arc [0:1*[8]] contains constants of sort Voters
Arc [0:1*[9]] contains constants of sort Voters
Arc [0:1*[10]] contains constants of sort Voters
Arc [0:1*[11]] contains constants of sort Voters
Arc [0:1*[12]] contains constants of sort Voters
Arc [0:1*[13]] contains constants of sort Voters
Arc [0:1*[14]] contains constants of sort Voters
Arc [0:1*[15]] contains constants of sort Voters
Arc [0:1*[16]] contains constants of sort Voters
Arc [0:1*[17]] contains constants of sort Voters
Arc [0:1*[18]] contains constants of sort Voters
Arc [0:1*[19]] contains constants of sort Voters
Arc [0:1*[20]] contains constants of sort Voters
Arc [0:1*[21]] contains constants of sort Voters
Arc [0:1*[22]] contains constants of sort Voters
Arc [0:1*[23]] contains constants of sort Voters
Arc [0:1*[24]] contains constants of sort Voters
Arc [0:1*[25]] contains constants of sort Voters
Arc [0:1*[26]] contains constants of sort Voters
Arc [0:1*[27]] contains constants of sort Voters
Arc [0:1*[28]] contains constants of sort Voters
Arc [0:1*[29]] contains constants of sort Voters
Arc [0:1*[30]] contains constants of sort Voters
Arc [0:1*[31]] contains constants of sort Voters
Arc [0:1*[32]] contains constants of sort Voters
Arc [0:1*[33]] contains constants of sort Voters
Arc [0:1*[34]] contains constants of sort Voters
Arc [0:1*[35]] contains constants of sort Voters
Arc [0:1*[36]] contains constants of sort Voters
Arc [0:1*[37]] contains constants of sort Voters
Arc [0:1*[38]] contains constants of sort Voters
Arc [0:1*[39]] contains constants of sort Voters
Arc [0:1*[40]] contains constants of sort Voters
Arc [0:1*[41]] contains constants of sort Voters
Arc [0:1*[42]] contains constants of sort Voters
Arc [0:1*[43]] contains constants of sort Voters
Arc [0:1*[44]] contains constants of sort Voters
Arc [0:1*[45]] contains constants of sort Voters
Arc [0:1*[46]] contains constants of sort Voters
Arc [0:1*[47]] contains constants of sort Voters
Arc [0:1*[48]] contains constants of sort Voters
Arc [0:1*[49]] contains constants of sort Voters
Arc [0:1*[50]] contains constants of sort Voters
Arc [0:1*[51]] contains constants of sort Voters
Arc [0:1*[52]] contains constants of sort Voters
Arc [0:1*[53]] contains constants of sort Voters
Arc [0:1*[54]] contains constants of sort Voters
Arc [0:1*[55]] contains constants of sort Voters
Arc [0:1*[56]] contains constants of sort Voters
Arc [0:1*[57]] contains constants of sort Voters
Arc [0:1*[58]] contains constants of sort Voters
Arc [0:1*[59]] contains constants of sort Voters
Arc [0:1*[60]] contains constants of sort Voters
Arc [0:1*[61]] contains constants of sort Voters
Arc [0:1*[62]] contains constants of sort Voters
Arc [0:1*[63]] contains constants of sort Voters
Arc [0:1*[64]] contains constants of sort Voters
Arc [0:1*[65]] contains constants of sort Voters
Arc [0:1*[66]] contains constants of sort Voters
Arc [0:1*[67]] contains constants of sort Voters
Arc [0:1*[68]] contains constants of sort Voters
Arc [0:1*[69]] contains constants of sort Voters
Arc [0:1*[70]] contains constants of sort Voters
Arc [0:1*[71]] contains constants of sort Voters
Arc [0:1*[72]] contains constants of sort Voters
Arc [0:1*[73]] contains constants of sort Voters
Arc [0:1*[74]] contains constants of sort Voters
Arc [0:1*[75]] contains constants of sort Voters
Arc [0:1*[76]] contains constants of sort Voters
Arc [0:1*[77]] contains constants of sort Voters
Arc [0:1*[78]] contains constants of sort Voters
Arc [0:1*[79]] contains constants of sort Voters
Arc [0:1*[80]] contains constants of sort Voters
Arc [0:1*[81]] contains constants of sort Voters
Arc [0:1*[82]] contains constants of sort Voters
Arc [0:1*[83]] contains constants of sort Voters
Arc [0:1*[84]] contains constants of sort Voters
Arc [0:1*[85]] contains constants of sort Voters
Arc [0:1*[86]] contains constants of sort Voters
Arc [0:1*[87]] contains constants of sort Voters
Arc [0:1*[88]] contains constants of sort Voters
Arc [0:1*[89]] contains constants of sort Voters
Arc [0:1*[90]] contains constants of sort Voters
Arc [0:1*[91]] contains constants of sort Voters
Arc [0:1*[92]] contains constants of sort Voters
Arc [0:1*[93]] contains constants of sort Voters
Arc [0:1*[94]] contains constants of sort Voters
Arc [0:1*[95]] contains constants of sort Voters
Arc [0:1*[96]] contains constants of sort Voters
Arc [0:1*[97]] contains constants of sort Voters
Arc [0:1*[98]] contains constants of sort Voters
Arc [0:1*[99]] contains constants of sort Voters
Arc [0:1*[100]] contains constants of sort Voters
Arc [0:1*[101]] contains constants of sort Voters
Arc [0:1*[102]] contains constants of sort Voters
Arc [0:1*[103]] contains constants of sort Voters
Arc [0:1*[104]] contains constants of sort Voters
Arc [0:1*[105]] contains constants of sort Voters
Arc [0:1*[106]] contains constants of sort Voters
Arc [0:1*[107]] contains constants of sort Voters
Arc [0:1*[108]] contains constants of sort Voters
Arc [0:1*[109]] contains constants of sort Voters
Arc [0:1*[110]] contains constants of sort Voters
Arc [0:1*[111]] contains constants of sort Voters
Arc [0:1*[112]] contains constants of sort Voters
Arc [0:1*[113]] contains constants of sort Voters
Arc [0:1*[114]] contains constants of sort Voters
Arc [0:1*[115]] contains constants of sort Voters
Arc [0:1*[116]] contains constants of sort Voters
Arc [0:1*[117]] contains constants of sort Voters
Arc [0:1*[118]] contains constants of sort Voters
Arc [0:1*[119]] contains constants of sort Voters
Arc [0:1*[120]] contains constants of sort Voters
Arc [0:1*[121]] contains constants of sort Voters
Arc [0:1*[122]] contains constants of sort Voters
Arc [0:1*[123]] contains constants of sort Voters
Arc [0:1*[124]] contains constants of sort Voters
Arc [0:1*[125]] contains constants of sort Voters
Arc [0:1*[126]] contains constants of sort Voters
Arc [0:1*[127]] contains constants of sort Voters
Arc [0:1*[128]] contains constants of sort Voters
Arc [0:1*[129]] contains constants of sort Voters
Arc [0:1*[130]] contains constants of sort Voters
Arc [0:1*[131]] contains constants of sort Voters
Arc [0:1*[132]] contains constants of sort Voters
Arc [0:1*[133]] contains constants of sort Voters
Arc [0:1*[134]] contains constants of sort Voters
Arc [0:1*[135]] contains constants of sort Voters
Arc [0:1*[136]] contains constants of sort Voters
Arc [0:1*[137]] contains constants of sort Voters
Arc [0:1*[138]] contains constants of sort Voters
Arc [0:1*[139]] contains constants of sort Voters
Arc [0:1*[140]] contains constants of sort Voters
Arc [0:1*[141]] contains constants of sort Voters
Arc [0:1*[142]] contains constants of sort Voters
Arc [0:1*[143]] contains constants of sort Voters
Arc [0:1*[144]] contains constants of sort Voters
Arc [0:1*[145]] contains constants of sort Voters
Arc [0:1*[146]] contains constants of sort Voters
Arc [0:1*[147]] contains constants of sort Voters
Arc [0:1*[148]] contains constants of sort Voters
Arc [0:1*[149]] contains constants of sort Voters
Arc [0:1*[150]] contains constants of sort Voters
Arc [0:1*[151]] contains constants of sort Voters
Arc [0:1*[152]] contains constants of sort Voters
Arc [0:1*[153]] contains constants of sort Voters
Arc [0:1*[154]] contains constants of sort Voters
Arc [0:1*[155]] contains constants of sort Voters
Arc [0:1*[156]] contains constants of sort Voters
Arc [0:1*[157]] contains constants of sort Voters
Arc [0:1*[158]] contains constants of sort Voters
Arc [0:1*[159]] contains constants of sort Voters
Arc [0:1*[160]] contains constants of sort Voters
Arc [0:1*[161]] contains constants of sort Voters
Arc [0:1*[162]] contains constants of sort Voters
Arc [0:1*[163]] contains constants of sort Voters
Arc [0:1*[164]] contains constants of sort Voters
Arc [0:1*[165]] contains constants of sort Voters
Arc [0:1*[166]] contains constants of sort Voters
Arc [0:1*[167]] contains constants of sort Voters
Arc [0:1*[168]] contains constants of sort Voters
Arc [0:1*[169]] contains constants of sort Voters
Arc [0:1*[170]] contains constants of sort Voters
Arc [0:1*[171]] contains constants of sort Voters
Arc [0:1*[172]] contains constants of sort Voters
Arc [0:1*[173]] contains constants of sort Voters
Arc [0:1*[174]] contains constants of sort Voters
Arc [0:1*[175]] contains constants of sort Voters
Arc [0:1*[176]] contains constants of sort Voters
Arc [0:1*[177]] contains constants of sort Voters
Arc [0:1*[178]] contains constants of sort Voters
Arc [0:1*[179]] contains constants of sort Voters
Arc [0:1*[180]] contains constants of sort Voters
Arc [0:1*[181]] contains constants of sort Voters
Arc [0:1*[182]] contains constants of sort Voters
Arc [0:1*[183]] contains constants of sort Voters
Arc [0:1*[184]] contains constants of sort Voters
Arc [0:1*[185]] contains constants of sort Voters
Arc [0:1*[186]] contains constants of sort Voters
Arc [0:1*[187]] contains constants of sort Voters
Arc [0:1*[188]] contains constants of sort Voters
Arc [0:1*[189]] contains constants of sort Voters
Arc [0:1*[190]] contains constants of sort Voters
Arc [0:1*[191]] contains constants of sort Voters
Arc [0:1*[192]] contains constants of sort Voters
Arc [0:1*[193]] contains constants of sort Voters
Arc [0:1*[194]] contains constants of sort Voters
Arc [0:1*[195]] contains constants of sort Voters
Arc [0:1*[196]] contains constants of sort Voters
Arc [0:1*[197]] contains constants of sort Voters
Arc [0:1*[198]] contains constants of sort Voters
Arc [0:1*[199]] contains constants of sort Voters
Transition start : constants on arcs in [[0:1*[0]], [0:1*[1]], [0:1*[2]], [0:1*[3]], [0:1*[4]], [0:1*[5]], [0:1*[6]], [0:1*[7]], [0:1*[8]], [0:1*[9]], [0:1*[10]], [0:1*[11]], [0:1*[12]], [0:1*[13]], [0:1*[14]], [0:1*[15]], [0:1*[16]], [0:1*[17]], [0:1*[18]], [0:1*[19]], [0:1*[20]], [0:1*[21]], [0:1*[22]], [0:1*[23]], [0:1*[24]], [0:1*[25]], [0:1*[26]], [0:1*[27]], [0:1*[28]], [0:1*[29]], [0:1*[30]], [0:1*[31]], [0:1*[32]], [0:1*[33]], [0:1*[34]], [0:1*[35]], [0:1*[36]], [0:1*[37]], [0:1*[38]], [0:1*[39]], [0:1*[40]], [0:1*[41]], [0:1*[42]], [0:1*[43]], [0:1*[44]], [0:1*[45]], [0:1*[46]], [0:1*[47]], [0:1*[48]], [0:1*[49]], [0:1*[50]], [0:1*[51]], [0:1*[52]], [0:1*[53]], [0:1*[54]], [0:1*[55]], [0:1*[56]], [0:1*[57]], [0:1*[58]], [0:1*[59]], [0:1*[60]], [0:1*[61]], [0:1*[62]], [0:1*[63]], [0:1*[64]], [0:1*[65]], [0:1*[66]], [0:1*[67]], [0:1*[68]], [0:1*[69]], [0:1*[70]], [0:1*[71]], [0:1*[72]], [0:1*[73]], [0:1*[74]], [0:1*[75]], [0:1*[76]], [0:1*[77]], [0:1*[78]], [0:1*[79]], [0:1*[80]], [0:1*[81]], [0:1*[82]], [0:1*[83]], [0:1*[84]], [0:1*[85]], [0:1*[86]], [0:1*[87]], [0:1*[88]], [0:1*[89]], [0:1*[90]], [0:1*[91]], [0:1*[92]], [0:1*[93]], [0:1*[94]], [0:1*[95]], [0:1*[96]], [0:1*[97]], [0:1*[98]], [0:1*[99]], [0:1*[100]], [0:1*[101]], [0:1*[102]], [0:1*[103]], [0:1*[104]], [0:1*[105]], [0:1*[106]], [0:1*[107]], [0:1*[108]], [0:1*[109]], [0:1*[110]], [0:1*[111]], [0:1*[112]], [0:1*[113]], [0:1*[114]], [0:1*[115]], [0:1*[116]], [0:1*[117]], [0:1*[118]], [0:1*[119]], [0:1*[120]], [0:1*[121]], [0:1*[122]], [0:1*[123]], [0:1*[124]], [0:1*[125]], [0:1*[126]], [0:1*[127]], [0:1*[128]], [0:1*[129]], [0:1*[130]], [0:1*[131]], [0:1*[132]], [0:1*[133]], [0:1*[134]], [0:1*[135]], [0:1*[136]], [0:1*[137]], [0:1*[138]], [0:1*[139]], [0:1*[140]], [0:1*[141]], [0:1*[142]], [0:1*[143]], [0:1*[144]], [0:1*[145]], [0:1*[146]], [0:1*[147]], [0:1*[148]], [0:1*[149]], [0:1*[150]], [0:1*[151]], [0:1*[152]], [0:1*[153]], [0:1*[154]], [0:1*[155]], [0:1*[156]], [0:1*[157]], [0:1*[158]], [0:1*[159]], [0:1*[160]], [0:1*[161]], [0:1*[162]], [0:1*[163]], [0:1*[164]], [0:1*[165]], [0:1*[166]], [0:1*[167]], [0:1*[168]], [0:1*[169]], [0:1*[170]], [0:1*[171]], [0:1*[172]], [0:1*[173]], [0:1*[174]], [0:1*[175]], [0:1*[176]], [0:1*[177]], [0:1*[178]], [0:1*[179]], [0:1*[180]], [0:1*[181]], [0:1*[182]], [0:1*[183]], [0:1*[184]], [0:1*[185]], [0:1*[186]], [0:1*[187]], [0:1*[188]], [0:1*[189]], [0:1*[190]], [0:1*[191]], [0:1*[192]], [0:1*[193]], [0:1*[194]], [0:1*[195]], [0:1*[196]], [0:1*[197]], [0:1*[198]], [0:1*[199]]] introduces in Voters(200) partition with 1 elements that refines current partition to 1 subsets.
Symmetric sort wr.t. initial detected :Voters
Symmetric sort wr.t. initial and guards detected :Voters
Applying symmetric unfolding of full symmetric sort :Voters domain size was 200
[2025-06-03 17:43:17] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 110 ms.
[2025-06-03 17:43:17] [INFO ] Unfolded 15 HLPN properties in 13 ms.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 25 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2025-06-03 17:43:17] [INFO ] Computed 0 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:17] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-03 17:43:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:17] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2025-06-03 17:43:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 203ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 215ms
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 2/4 places, 2/3 transitions.
Support contains 2 out of 2 places after structural reductions.
[2025-06-03 17:43:18] [INFO ] Flatten gal took : 5 ms
[2025-06-03 17:43:18] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:43:18] [INFO ] Input system was already deterministic with 2 transitions.
Reduction of identical properties reduced properties to check from 12 to 9
RANDOM walk for 40596 steps (196 resets) in 371 ms. (109 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40596 steps (196 resets) in 212 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40596 steps (196 resets) in 134 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40596 steps (196 resets) in 104 ms. (386 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40596 steps (196 resets) in 94 ms. (427 steps per ms) remains 4/4 properties
[2025-06-03 17:43:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 4 solved, 0 unsolved in 47 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
[2025-06-03 17:43:18] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:43:18] [INFO ] Flatten gal took : 2 ms
[2025-06-03 17:43:18] [INFO ] Input system was already deterministic with 2 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA Referendum-COL-0200-CTLFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2025-06-03 17:43:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:18] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 17:43:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:18] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2025-06-03 17:43:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 42 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 53 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 2/2 places, 2/2 transitions.
[2025-06-03 17:43:18] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:18] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:18] [INFO ] Input system was already deterministic with 2 transitions.
[2025-06-03 17:43:18] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:18] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:18] [INFO ] Time to serialize gal into /tmp/CTLFireability2750607306890702413.gal : 1 ms
[2025-06-03 17:43:18] [INFO ] Time to serialize properties into /tmp/CTLFireability3270747176289786976.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2750607306890702413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3270747176289786976.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,202,0.067783,4384,2,4,5,1008,6,0,11,806,0


Converting to forward existential form...Done !
original formula: EG((EX(AF((voting>=1))) + (EG(AG((ready<1))) * (voting>=1))))
=> equivalent forward existential formula: [FwdG(Init,(EX(!(EG(!((voting>=1))))) + (EG(!(E(TRUE U !((ready<1))))) * (voting>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
dead was empty
(forward)formula 0,0,0.18523,5024,1,0,415,1632,32,616,445,2627,1230
FORMULA Referendum-COL-0200-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Graph (complete) has 1 edges and 2 vertex of which 1 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 16 ms. Remains 1 /2 variables (removed 1) and now considering 1/2 (removed 1) transitions.
// Phase 1: matrix 1 rows 1 cols
[2025-06-03 17:43:19] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-03 17:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:19] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:43:19] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_CTL mode, iteration 1 : 1/2 places, 1/2 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 1/2 places, 1/2 transitions.
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 2 ms
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:19] [INFO ] Input system was already deterministic with 1 transitions.
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 2 ms
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2196449373350679183.gal : 1 ms
[2025-06-03 17:43:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4942360199662114104.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2196449373350679183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4942360199662114104.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2,0.002472,3660,2,2,5,6,6,0,5,4,0


Converting to forward existential form...Done !
original formula: EG(AG(AF(EG((ready<1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!(EG((ready<1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.004051,3916,1,0,6,8,25,6,25,11,10
FORMULA Referendum-COL-0200-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2025-06-03 17:43:19] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-03 17:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:19] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:43:19] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-06-03 17:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 34 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 47 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 85ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 146 ms. Remains : 2/2 places, 2/2 transitions.
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:19] [INFO ] Input system was already deterministic with 2 transitions.
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16538718981508568625.gal : 1 ms
[2025-06-03 17:43:19] [INFO ] Time to serialize properties into /tmp/CTLFireability7839899356555646866.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16538718981508568625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7839899356555646866.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,202,0.047451,4428,2,4,5,1008,6,0,11,806,0


Converting to forward existential form...Done !
original formula: AG(EF((((ready>=1) * EF((voting>=1))) * AF((voting>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((ready>=1) * E(TRUE U (voting>=1))) * !(EG(!((voting>=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,0,0.086095,4684,1,0,217,1236,28,13,444,1046,231
FORMULA Referendum-COL-0200-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2025-06-03 17:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:19] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-03 17:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:19] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2025-06-03 17:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 80ms
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 2/2 places, 2/2 transitions.
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:43:19] [INFO ] Input system was already deterministic with 2 transitions.
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:19] [INFO ] Time to serialize gal into /tmp/CTLFireability5975145976006534345.gal : 0 ms
[2025-06-03 17:43:19] [INFO ] Time to serialize properties into /tmp/CTLFireability5436866472048925428.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5975145976006534345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5436866472048925428.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,202,0.056955,4428,2,4,5,1008,6,0,11,806,0


Converting to forward existential form...Done !
original formula: EF(!(E((voting>=1) U E(AX((ready>=1)) U EF((voting>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((voting>=1) U E(!(EX(!((ready>=1)))) U E(TRUE U (voting>=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,1,0.063497,4684,1,0,17,1008,29,12,443,806,26
FORMULA Referendum-COL-0200-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2025-06-03 17:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 17:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:19] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2025-06-03 17:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 2/2 places, 2/2 transitions.
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 2 ms
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:19] [INFO ] Input system was already deterministic with 2 transitions.
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:19] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:19] [INFO ] Time to serialize gal into /tmp/CTLFireability8170425331398146149.gal : 1 ms
[2025-06-03 17:43:19] [INFO ] Time to serialize properties into /tmp/CTLFireability718380309853803299.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8170425331398146149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability718380309853803299.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,202,0.057375,4428,2,4,5,1008,6,0,11,806,0


Converting to forward existential form...Done !
original formula: AF(!(E(EX((((ready>=1)||(voting>=1))&&(voting>=1))) U A((EF((voting>=1)) + AX((voting>=1))) U ((voting>=1)||(ready>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(EX((((ready>=1)||(voting>=1))&&(voting>=1))) U !((E(!(((voting>=1)||(ready>=1))) U (!((E(TRUE U...277
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
dead was empty
(forward)formula 0,1,0.108465,4684,1,0,219,1238,33,15,448,1054,240
FORMULA Referendum-COL-0200-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2025-06-03 17:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:19] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-03 17:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:20] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:43:20] [INFO ] Redundant transitions in 1 ms returned []
Running 1 sub problems to find dead transitions.
[2025-06-03 17:43:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 41 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 58 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 161 ms. Remains : 2/2 places, 2/2 transitions.
[2025-06-03 17:43:20] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:20] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:20] [INFO ] Input system was already deterministic with 2 transitions.
[2025-06-03 17:43:20] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:20] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:20] [INFO ] Time to serialize gal into /tmp/CTLFireability18236963450552972226.gal : 0 ms
[2025-06-03 17:43:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13828032231979250463.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18236963450552972226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13828032231979250463.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,202,0.063209,4428,2,4,5,1008,6,0,11,806,0


Converting to forward existential form...Done !
original formula: EF(!(E(AF((voting>=1)) U ((EF((voting>=1)) + (ready>=1)) + (voting>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EG(!((voting>=1)))) U ((E(TRUE U (voting>=1)) + (ready>=1)) + (voting>=1)))))] != FALS...156
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,1,0.1163,4684,1,0,217,1235,31,15,444,1049,230
FORMULA Referendum-COL-0200-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2025-06-03 17:43:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:20] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 17:43:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:20] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2025-06-03 17:43:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 59 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 2/2 places, 2/2 transitions.
[2025-06-03 17:43:20] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:20] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:20] [INFO ] Input system was already deterministic with 2 transitions.
[2025-06-03 17:43:20] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:20] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:43:20] [INFO ] Time to serialize gal into /tmp/CTLFireability12565036422454372109.gal : 0 ms
[2025-06-03 17:43:20] [INFO ] Time to serialize properties into /tmp/CTLFireability4612859020930546176.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12565036422454372109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4612859020930546176.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,202,0.067858,4428,2,4,5,1008,6,0,11,806,0


Converting to forward existential form...Done !
original formula: AX(AG(EF((voting>=1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U (voting>=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,0,0.132009,4684,1,0,17,1233,22,7,443,1038,17
FORMULA Referendum-COL-0200-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2025-06-03 17:43:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:20] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-03 17:43:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2025-06-03 17:43:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 47 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 2/2 places, 2/2 transitions.
[2025-06-03 17:43:20] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:20] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:20] [INFO ] Input system was already deterministic with 2 transitions.
[2025-06-03 17:43:20] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:20] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:43:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6094794109166005664.gal : 1 ms
[2025-06-03 17:43:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9142523714556326301.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6094794109166005664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9142523714556326301.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,202,0.110316,4428,2,4,5,1008,6,0,11,806,0


Converting to forward existential form...Done !
original formula: EF(EG((AX(AF((ready>=1))) + (AX(EX((voting>=1))) * A((ready<1) U (ready>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EX(!(!(EG(!((ready>=1))))))) + (!(EX(!(EX((voting>=1))))) * !((E(!((ready>=1)) U (!((re...215
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,1,0.302804,5324,1,0,415,1630,28,418,444,2394,1426
FORMULA Referendum-COL-0200-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2025-06-03 17:43:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:21] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 17:43:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:21] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2025-06-03 17:43:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 42 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 61 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 2/2 places, 2/2 transitions.
[2025-06-03 17:43:21] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:21] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:21] [INFO ] Input system was already deterministic with 2 transitions.
[2025-06-03 17:43:21] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:21] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17114378628461471795.gal : 0 ms
[2025-06-03 17:43:21] [INFO ] Time to serialize properties into /tmp/CTLFireability17737603508301914280.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17114378628461471795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17737603508301914280.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,202,0.078446,4428,2,4,5,1008,6,0,11,806,0


Converting to forward existential form...Done !
original formula: EF((A((voting>=1) U EX((EX((voting>=1)) * (voting<1)))) * EF(AG((voting<1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((E(!(EX((EX((voting>=1)) * (voting<1)))) U (!((voting>=1)) * !(EX((EX((voting>=1)) *...264
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,0,0.428431,6348,1,0,813,2630,24,814,444,3679,2030
FORMULA Referendum-COL-0200-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2025-06-03 17:43:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:21] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 17:43:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:43:21] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-06-03 17:43:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 46 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 155 ms. Remains : 2/2 places, 2/2 transitions.
[2025-06-03 17:43:21] [INFO ] Flatten gal took : 2 ms
[2025-06-03 17:43:21] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:21] [INFO ] Input system was already deterministic with 2 transitions.
[2025-06-03 17:43:21] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:21] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17913125139051585633.gal : 1 ms
[2025-06-03 17:43:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9771456374651976183.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17913125139051585633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9771456374651976183.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,202,0.07941,4428,2,4,5,1008,6,0,11,806,0


Converting to forward existential form...Done !
original formula: A(!(A((voting<1) U (AG((voting>=1)) * (ready<1)))) U (!(EG(E((ready>=1) U (voting>=1)))) * !(EG(AG((voting>=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(E((ready>=1) U (voting>=1)))) * !(EG(!(E(TRUE U !((voting>=1))))))))))) * !(E(!((!(EG(E((...491
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,1,0.343427,6604,1,0,813,2625,34,412,444,2790,1228
FORMULA Referendum-COL-0200-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2025-06-03 17:43:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:22] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-03 17:43:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:22] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2025-06-03 17:43:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 50 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 2/2 places, 2/2 transitions.
[2025-06-03 17:43:22] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:22] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:22] [INFO ] Input system was already deterministic with 2 transitions.
[2025-06-03 17:43:22] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:22] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:22] [INFO ] Time to serialize gal into /tmp/CTLFireability10228402935262609793.gal : 0 ms
[2025-06-03 17:43:22] [INFO ] Time to serialize properties into /tmp/CTLFireability11544558676758620349.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10228402935262609793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11544558676758620349.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,202,0.080323,4428,2,4,5,1008,6,0,11,806,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(EX(((voting>=1)||(ready>=1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U EX(((voting>=1)||(ready>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,0,0.161349,4684,1,0,19,1240,22,9,444,1044,20
FORMULA Referendum-COL-0200-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2025-06-03 17:43:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:22] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-03 17:43:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:22] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2025-06-03 17:43:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 49 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 2/2 places, 2/2 transitions.
[2025-06-03 17:43:22] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:22] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:22] [INFO ] Input system was already deterministic with 2 transitions.
[2025-06-03 17:43:22] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:22] [INFO ] Flatten gal took : 2 ms
[2025-06-03 17:43:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16603925565079249331.gal : 1 ms
[2025-06-03 17:43:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1660077695891409426.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16603925565079249331.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1660077695891409426.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,202,0.082509,4428,2,4,5,1008,6,0,11,806,0


Converting to forward existential form...Done !
original formula: EG(EF((((voting>=1) * AX(((voting>=1)||(ready>=1)))) * (EG((voting<1)) * EX((voting<1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((voting>=1) * !(EX(!(((voting>=1)||(ready>=1)))))) * (EG((voting<1)) * EX((voting<1))))))]...164
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
dead was empty
(forward)formula 0,0,0.146944,4684,1,0,213,1226,27,8,446,1029,221
FORMULA Referendum-COL-0200-CTLFireability-2025-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2025-06-03 17:43:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 17:43:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:22] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2025-06-03 17:43:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 46 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 2/2 places, 2/2 transitions.
[2025-06-03 17:43:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:23] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:23] [INFO ] Input system was already deterministic with 2 transitions.
[2025-06-03 17:43:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13252182058066861457.gal : 1 ms
[2025-06-03 17:43:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15660942406774466348.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13252182058066861457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15660942406774466348.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,202,0.078557,4428,2,4,5,1008,6,0,11,806,0


Converting to forward existential form...Done !
original formula: E(AF((voting>=1)) U EX(!(EG((voting>=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,!(EG(!((voting>=1)))))) * !(EG((voting>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,1,0.243897,5324,1,0,611,1819,29,412,442,2783,825
FORMULA Referendum-COL-0200-CTLFireability-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2025-06-03 17:43:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:23] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-03 17:43:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:23] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2025-06-03 17:43:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 52 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 146ms
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 2/2 places, 2/2 transitions.
[2025-06-03 17:43:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:23] [INFO ] Flatten gal took : 0 ms
[2025-06-03 17:43:23] [INFO ] Input system was already deterministic with 2 transitions.
[2025-06-03 17:43:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9651718207617853020.gal : 1 ms
[2025-06-03 17:43:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2590967807985827235.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9651718207617853020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2590967807985827235.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,202,0.079897,4428,2,4,5,1008,6,0,11,806,0


Converting to forward existential form...Done !
original formula: AX(EG(AF((ready>=1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG(!((ready>=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,0,0.267472,5068,1,0,411,1623,25,410,442,2376,1418
FORMULA Referendum-COL-0200-CTLFireability-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2025-06-03 17:43:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 17:43:23] [INFO ] Flatten gal took : 1 ms
Total runtime 7975 ms.

BK_STOP 1748972603932

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="Referendum-COL-0200"
export BK_EXAMINATION="CTLFireability"
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 Referendum-COL-0200, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-smll-174889233400154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0200.tgz
mv Referendum-COL-0200 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;