fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r312-tall-171662338800537
Last Updated
July 7, 2024

About the Execution of ITS-Tools for Referendum-COL-0050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
326.716 5295.00 12351.00 130.90 FTFTFFFTTFTTTFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r312-tall-171662338800537.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Referendum-COL-0050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662338800537
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.9K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-00
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-01
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-02
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-03
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-04
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-05
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-06
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-07
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-08
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-09
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-10
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-11
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-12
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-13
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-14
FORMULA_NAME Referendum-COL-0050-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716699315255

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-COL-0050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-26 04:55:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 04:55:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 04:55: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.
[2024-05-26 04:55:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 04:55:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 474 ms
[2024-05-26 04:55:16] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 151 PT places and 101.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
[2024-05-26 04:55:16] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 3 ms.
[2024-05-26 04:55:16] [INFO ] Skeletonized 16 HLPN properties in 3 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).
Remains 16 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).
RANDOM walk for 40064 steps (752 resets) in 409 ms. (97 steps per ms) remains 32/66 properties
BEST_FIRST walk for 4000 steps (24 resets) in 124 ms. (32 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 117 ms. (33 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 97 ms. (40 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 48 ms. (81 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 34 ms. (114 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 28 ms. (137 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 22 ms. (173 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 36 ms. (108 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (24 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
// Phase 1: matrix 3 rows 4 cols
[2024-05-26 04:55:17] [INFO ] Computed 1 invariants in 3 ms
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp64 is UNSAT
After SMT solving in domain Real declared 4/7 variables, and 1 constraints, problems are : Problem set: 32 solved, 0 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 163ms problems are : Problem set: 32 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 32 atomic propositions for a total of 16 simplifications.
FORMULA Referendum-COL-0050-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0050-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0050-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0050-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 04:55:18] [INFO ] Flatten gal took : 15 ms
[2024-05-26 04:55:18] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA Referendum-COL-0050-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0050-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0050-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 04:55:18] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [3:1*[0]] contains constants of sort Voters
Arc [3:1*[1]] contains constants of sort Voters
Arc [3:1*[2]] contains constants of sort Voters
Arc [3:1*[3]] contains constants of sort Voters
Arc [3:1*[4]] contains constants of sort Voters
Arc [3:1*[5]] contains constants of sort Voters
Arc [3:1*[6]] contains constants of sort Voters
Arc [3:1*[7]] contains constants of sort Voters
Arc [3:1*[8]] contains constants of sort Voters
Arc [3:1*[9]] contains constants of sort Voters
Arc [3:1*[10]] contains constants of sort Voters
Arc [3:1*[11]] contains constants of sort Voters
Arc [3:1*[12]] contains constants of sort Voters
Arc [3:1*[13]] contains constants of sort Voters
Arc [3:1*[14]] contains constants of sort Voters
Arc [3:1*[15]] contains constants of sort Voters
Arc [3:1*[16]] contains constants of sort Voters
Arc [3:1*[17]] contains constants of sort Voters
Arc [3:1*[18]] contains constants of sort Voters
Arc [3:1*[19]] contains constants of sort Voters
Arc [3:1*[20]] contains constants of sort Voters
Arc [3:1*[21]] contains constants of sort Voters
Arc [3:1*[22]] contains constants of sort Voters
Arc [3:1*[23]] contains constants of sort Voters
Arc [3:1*[24]] contains constants of sort Voters
Arc [3:1*[25]] contains constants of sort Voters
Arc [3:1*[26]] contains constants of sort Voters
Arc [3:1*[27]] contains constants of sort Voters
Arc [3:1*[28]] contains constants of sort Voters
Arc [3:1*[29]] contains constants of sort Voters
Arc [3:1*[30]] contains constants of sort Voters
Arc [3:1*[31]] contains constants of sort Voters
Arc [3:1*[32]] contains constants of sort Voters
Arc [3:1*[33]] contains constants of sort Voters
Arc [3:1*[34]] contains constants of sort Voters
Arc [3:1*[35]] contains constants of sort Voters
Arc [3:1*[36]] contains constants of sort Voters
Arc [3:1*[37]] contains constants of sort Voters
Arc [3:1*[38]] contains constants of sort Voters
Arc [3:1*[39]] contains constants of sort Voters
Arc [3:1*[40]] contains constants of sort Voters
Arc [3:1*[41]] contains constants of sort Voters
Arc [3:1*[42]] contains constants of sort Voters
Arc [3:1*[43]] contains constants of sort Voters
Arc [3:1*[44]] contains constants of sort Voters
Arc [3:1*[45]] contains constants of sort Voters
Arc [3:1*[46]] contains constants of sort Voters
Arc [3:1*[47]] contains constants of sort Voters
Arc [3:1*[48]] contains constants of sort Voters
Arc [3:1*[49]] contains constants of sort Voters
Transition start : constants on arcs in [[3:1*[0]], [3:1*[1]], [3:1*[2]], [3:1*[3]], [3:1*[4]], [3:1*[5]], [3:1*[6]], [3:1*[7]], [3:1*[8]], [3:1*[9]], [3:1*[10]], [3:1*[11]], [3:1*[12]], [3:1*[13]], [3:1*[14]], [3:1*[15]], [3:1*[16]], [3:1*[17]], [3:1*[18]], [3:1*[19]], [3:1*[20]], [3:1*[21]], [3:1*[22]], [3:1*[23]], [3:1*[24]], [3:1*[25]], [3:1*[26]], [3:1*[27]], [3:1*[28]], [3:1*[29]], [3:1*[30]], [3:1*[31]], [3:1*[32]], [3:1*[33]], [3:1*[34]], [3:1*[35]], [3:1*[36]], [3:1*[37]], [3:1*[38]], [3:1*[39]], [3:1*[40]], [3:1*[41]], [3:1*[42]], [3:1*[43]], [3:1*[44]], [3:1*[45]], [3:1*[46]], [3:1*[47]], [3:1*[48]], [3:1*[49]]] introduces in Voters(50) 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 50
[2024-05-26 04:55:18] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 16 ms.
[2024-05-26 04:55:18] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 4 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-05-26 04:55:18] [INFO ] Invariant cache hit.
[2024-05-26 04:55:18] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-26 04:55:18] [INFO ] Invariant cache hit.
[2024-05-26 04:55:18] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-05-26 04:55:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 4/4 places, 3/3 transitions.
Support contains 4 out of 4 places after structural reductions.
[2024-05-26 04:55:18] [INFO ] Flatten gal took : 2 ms
[2024-05-26 04:55:18] [INFO ] Flatten gal took : 2 ms
[2024-05-26 04:55:18] [INFO ] Input system was already deterministic with 3 transitions.
RANDOM walk for 40064 steps (752 resets) in 105 ms. (377 steps per ms) remains 12/38 properties
BEST_FIRST walk for 40004 steps (260 resets) in 196 ms. (203 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (260 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (260 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (260 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (260 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (260 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (260 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (260 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (260 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (260 resets) in 145 ms. (274 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (260 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (260 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
[2024-05-26 04:55:18] [INFO ] Invariant cache hit.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp36 is UNSAT
After SMT solving in domain Real declared 4/7 variables, and 1 constraints, problems are : Problem set: 12 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 26ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 12 atomic propositions for a total of 9 simplifications.
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:19] [INFO ] Input system was already deterministic with 3 transitions.
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).
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-05-26 04:55:19] [INFO ] Invariant cache hit.
[2024-05-26 04:55:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-26 04:55:19] [INFO ] Invariant cache hit.
[2024-05-26 04:55:19] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-05-26 04:55:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 4/4 places, 3/3 transitions.
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:19] [INFO ] Input system was already deterministic with 3 transitions.
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 0 ms
[2024-05-26 04:55:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality8418971332790338239.gal : 1 ms
[2024-05-26 04:55:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality5537184933811087358.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8418971332790338239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5537184933811087358.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1327,0.019602,3484,2,106,5,2180,6,0,15,1877,0


Converting to forward existential form...Done !
original formula: E((A(AX(!(EX((voted_no<=20)))) U AF(((voted_no<=voting)&&((voted_no<=40)||(voted_no<=voted_yes))))) + AG((EG((voted_no>=30)) * AX(AF((vot...190
=> equivalent forward existential formula: [(FwdU(Init,(!((E(!(!(EG(!(((voted_no<=voting)&&((voted_no<=40)||(voted_no<=voted_yes))))))) U (!(!(EX(!(!(EX((v...443
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 1/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 2/0/1
(forward)formula 0,1,0.184817,7736,1,0,274,13860,47,170,520,22652,285
FORMULA Referendum-COL-0050-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 4 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-26 04:55:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 04:55:19] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-26 04:55:19] [INFO ] Invariant cache hit.
[2024-05-26 04:55:19] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-05-26 04:55:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 31 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 37 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 3/4 places, 3/3 transitions.
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 2 ms
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:19] [INFO ] Input system was already deterministic with 3 transitions.
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 0 ms
[2024-05-26 04:55:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality6488741528599792845.gal : 1 ms
[2024-05-26 04:55:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality864257287278713994.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6488741528599792845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality864257287278713994.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1327,0.007418,3284,2,55,5,655,6,0,13,501,0


Converting to forward existential form...Done !
original formula: (EX((voted_no>voting)) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(EX((voted_no>voting))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,0,0.014047,3600,1,0,17,765,20,9,310,888,14
FORMULA Referendum-COL-0050-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 2 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 9 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-26 04:55:19] [INFO ] Computed 0 invariants in 1 ms
[2024-05-26 04:55:19] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-26 04:55:19] [INFO ] Invariant cache hit.
[2024-05-26 04:55:19] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-26 04:55:19] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-26 04:55:19] [INFO ] Invariant cache hit.
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 32 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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 35 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 123 ms. Remains : 2/4 places, 2/3 transitions.
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:19] [INFO ] Input system was already deterministic with 2 transitions.
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality9417006015300337046.gal : 0 ms
[2024-05-26 04:55:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality2314317159499462822.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9417006015300337046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2314317159499462822.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,52,0.005996,3276,2,4,5,258,6,0,11,206,0


Converting to forward existential form...Done !
original formula: EG(AF((voting<=ready)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((voting<=ready)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,1,0.012725,3592,1,0,61,469,23,7,245,427,62
FORMULA Referendum-COL-0050-CTLCardinality-2024-03 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 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-26 04:55:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 04:55:19] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-26 04:55:19] [INFO ] Invariant cache hit.
[2024-05-26 04:55:19] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-05-26 04:55:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 62ms
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 3/4 places, 3/3 transitions.
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 0 ms
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 0 ms
[2024-05-26 04:55:19] [INFO ] Input system was already deterministic with 3 transitions.
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 0 ms
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality7885406794153429409.gal : 1 ms
[2024-05-26 04:55:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality5818606617060972886.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7885406794153429409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5818606617060972886.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1327,0.007042,3288,2,55,5,655,6,0,13,501,0


Converting to forward existential form...Done !
original formula: EG(AX(EX(AX((voted_no>=11)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EX(!(EX(!((voted_no>=11)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,0,0.01836,3868,1,0,78,2279,26,16,210,2504,74
FORMULA Referendum-COL-0050-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 2 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-26 04:55:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 04:55:19] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-26 04:55:19] [INFO ] Invariant cache hit.
[2024-05-26 04:55:19] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-26 04:55: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 : 2/4 places, 2/3 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 2/4 places, 2/3 transitions.
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 0 ms
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 0 ms
[2024-05-26 04:55:19] [INFO ] Input system was already deterministic with 2 transitions.
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:19] [INFO ] Flatten gal took : 0 ms
[2024-05-26 04:55:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality9259959367476203771.gal : 1 ms
[2024-05-26 04:55:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality756677787332231496.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9259959367476203771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality756677787332231496.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1326,0.006344,3276,2,53,5,552,6,0,8,548,0


Converting to forward existential form...Done !
original formula: EG((voted_no<=0))
=> equivalent forward existential formula: [FwdG(Init,(voted_no<=0))] != FALSE
Hit Full ! (commute/partial/dont) 1/0/1
(forward)formula 0,1,0.015288,3592,1,0,58,1006,18,4,138,1106,57
FORMULA Referendum-COL-0050-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-26 04:55:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 04:55:19] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-26 04:55:19] [INFO ] Invariant cache hit.
[2024-05-26 04:55:19] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-26 04:55:19] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-26 04:55:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 30 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 27 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 61ms
Starting structural reductions in SI_CTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 105 ms. Remains : 3/4 places, 3/3 transitions.
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:20] [INFO ] Input system was already deterministic with 3 transitions.
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 0 ms
[2024-05-26 04:55:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality12944134898054812437.gal : 0 ms
[2024-05-26 04:55:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality3610732896266978255.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12944134898054812437.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3610732896266978255.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1327,0.007044,3284,2,55,5,655,6,0,13,501,0


Converting to forward existential form...Done !
original formula: !(E(EF((voted_yes<=ready)) U (EF(((ready<=voting)&&(voted_yes>=37))) + !(EF((voting<=ready))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,E(TRUE U (voted_yes<=ready))),TRUE) * ((ready<=voting)&&(voted_yes>=37)))] = FALSE * [(FwdU(In...229
Reverse transition relation is NOT exact ! Due to transitions t1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,0,0.032901,4392,1,0,169,3194,32,113,472,3739,182
FORMULA Referendum-COL-0050-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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 0 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-26 04:55:20] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 04:55:20] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-26 04:55:20] [INFO ] Invariant cache hit.
[2024-05-26 04:55:20] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2024-05-26 04:55:20] [INFO ] Invariant cache hit.
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 19 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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 23 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 44ms
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 2/4 places, 2/3 transitions.
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 0 ms
[2024-05-26 04:55:20] [INFO ] Input system was already deterministic with 2 transitions.
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 0 ms
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 0 ms
[2024-05-26 04:55:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality10702523460591669401.gal : 0 ms
[2024-05-26 04:55:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality3964562175174377457.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10702523460591669401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3964562175174377457.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,52,0.006436,3276,2,4,5,258,6,0,11,206,0


Converting to forward existential form...Done !
original formula: AX((voting>=28))
=> equivalent forward existential formula: [(EY(Init) * !((voting>=28)))] = FALSE
(forward)formula 0,1,0.007011,3592,1,0,9,258,9,2,40,206,2
FORMULA Referendum-COL-0050-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-26 04:55:20] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 04:55:20] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-26 04:55:20] [INFO ] Invariant cache hit.
[2024-05-26 04:55:20] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-05-26 04:55:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 3/4 places, 3/3 transitions.
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 0 ms
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 0 ms
[2024-05-26 04:55:20] [INFO ] Input system was already deterministic with 3 transitions.
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality14568567012598627953.gal : 0 ms
[2024-05-26 04:55:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality18155858535876558984.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14568567012598627953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18155858535876558984.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1327,0.010666,3284,2,55,5,655,6,0,13,501,0


Converting to forward existential form...Done !
original formula: EF(EX(((ready>=32)||(voted_yes>=46))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * ((ready>=32)||(voted_yes>=46)))] != FALSE
(forward)formula 0,1,0.013156,3600,1,0,8,655,8,1,121,501,2
FORMULA Referendum-COL-0050-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2024-05-26 04:55:20] [INFO ] Computed 1 invariants in 1 ms
[2024-05-26 04:55:20] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-26 04:55:20] [INFO ] Invariant cache hit.
[2024-05-26 04:55:20] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-05-26 04:55:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 4/4 places, 3/3 transitions.
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:20] [INFO ] Input system was already deterministic with 3 transitions.
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality5688803340395086408.gal : 1 ms
[2024-05-26 04:55:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality1713982067074539925.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5688803340395086408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1713982067074539925.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1327,0.009724,3596,2,106,5,2180,6,0,15,1877,0


Converting to forward existential form...Done !
original formula: AX(A((voting<28) U EF(AG(((voting>=85)||(voted_yes<=voted_no))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(E(TRUE U !(E(TRUE U !(((voting>=85)||(voted_yes<=voted_no)))))))) * !((voting<28))) * !(E(TR...320
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.122998,7028,1,0,66,10806,26,8,373,11463,65
FORMULA Referendum-COL-0050-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-26 04:55:20] [INFO ] Flatten gal took : 1 ms
[2024-05-26 04:55:20] [INFO ] Flatten gal took : 1 ms
Total runtime 4196 ms.

BK_STOP 1716699320550

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-0050"
export BK_EXAMINATION="CTLCardinality"
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-5568"
echo " Executing tool itstools"
echo " Input is Referendum-COL-0050, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-171662338800537"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0050.tgz
mv Referendum-COL-0050 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;