About the Execution of ITS-Tools for NeoElection-COL-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.892 | 1682820.00 | 1733535.00 | 5824.50 | FTTFTFTTFFTTFFFT | 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.r246-tall-171654351700465.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 NeoElection-COL-5, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351700465
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.8K Apr 11 18:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 18:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 18:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 18:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 19:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 11 19:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 89K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-00
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-01
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-02
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-03
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-04
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-05
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-06
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-07
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-08
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-09
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-10
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-11
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-12
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-13
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-14
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716680088196
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-25 23:34:49] [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-25 23:34:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 23:34:49] [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-25 23:34:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 23:34:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 598 ms
[2024-05-25 23:34:50] [INFO ] Detected 6 constant HL places corresponding to 1500 PT places.
[2024-05-25 23:34:50] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 3090 PT places and 7716.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2024-05-25 23:34:50] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 4 ms.
[2024-05-25 23:34:50] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Remains 16 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-5-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 40009 steps (1187 resets) in 800 ms. (49 steps per ms) remains 15/21 properties
BEST_FIRST walk for 4004 steps (92 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (18 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (24 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4004 steps (23 resets) in 26 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (19 resets) in 33 ms. (117 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (26 resets) in 26 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (92 resets) in 35 ms. (111 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (25 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (92 resets) in 17 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 13/13 properties
// Phase 1: matrix 7 rows 6 cols
[2024-05-25 23:34:50] [INFO ] Computed 1 invariants in 8 ms
[2024-05-25 23:34:50] [INFO ] State equation strengthened by 2 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Real declared 5/13 variables, and 1 constraints, problems are : Problem set: 13 solved, 0 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/6 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 13 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 13 atomic propositions for a total of 12 simplifications.
FORMULA NeoElection-COL-5-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 23:34:50] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-05-25 23:34:50] [INFO ] Flatten gal took : 14 ms
[2024-05-25 23:34:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NeoElection-COL-5-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 23:34:50] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Domain [M(6), POS(5), M(6)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 5)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-25 23:34:51] [INFO ] Unfolded HLPN to a Petri net with 3090 places and 4024 transitions 22762 arcs in 103 ms.
[2024-05-25 23:34:51] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Deduced a syphon composed of 2866 places in 14 ms
Reduce places removed 2891 places and 3788 transitions.
Reduce places removed 6 places and 0 transitions.
Support contains 125 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 236/236 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 173 transition count 236
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 35 place count 158 transition count 146
Iterating global reduction 1 with 15 rules applied. Total rules applied 50 place count 158 transition count 146
Applied a total of 50 rules in 16 ms. Remains 158 /193 variables (removed 35) and now considering 146/236 (removed 90) transitions.
[2024-05-25 23:34:51] [INFO ] Flow matrix only has 130 transitions (discarded 16 similar events)
// Phase 1: matrix 130 rows 158 cols
[2024-05-25 23:34:51] [INFO ] Computed 34 invariants in 16 ms
[2024-05-25 23:34:51] [INFO ] Implicit Places using invariants in 146 ms returned [13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 158 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/193 places, 146/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 185 ms. Remains : 133/193 places, 146/236 transitions.
Support contains 125 out of 133 places after structural reductions.
[2024-05-25 23:34:51] [INFO ] Flatten gal took : 20 ms
[2024-05-25 23:34:51] [INFO ] Flatten gal took : 17 ms
[2024-05-25 23:34:51] [INFO ] Input system was already deterministic with 146 transitions.
FORMULA NeoElection-COL-5-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (144 resets) in 2131 ms. (18 steps per ms) remains 9/15 properties
BEST_FIRST walk for 40003 steps (22 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 176 ms. (226 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (21 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (20 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (28 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (23 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (28 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (28 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
[2024-05-25 23:34:52] [INFO ] Flow matrix only has 130 transitions (discarded 16 similar events)
// Phase 1: matrix 130 rows 133 cols
[2024-05-25 23:34:52] [INFO ] Computed 9 invariants in 2 ms
[2024-05-25 23:34:52] [INFO ] State equation strengthened by 10 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 5/125 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-25 23:34:52] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 5 ms to minimize.
[2024-05-25 23:34:52] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-25 23:34:52] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-25 23:34:52] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 2 ms to minimize.
[2024-05-25 23:34:52] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-25 23:34:53] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-25 23:34:53] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-25 23:34:53] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:34:53] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-25 23:34:53] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-25 23:34:53] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 2 ms to minimize.
[2024-05-25 23:34:53] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-25 23:34:53] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-25 23:34:53] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
[2024-05-25 23:34:53] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 15/20 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/20 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Real declared 255/263 variables, and 145 constraints, problems are : Problem set: 9 solved, 0 unsolved in 1020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/9 constraints, State Equation: 125/133 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 15/15 constraints]
After SMT, in 1071ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 6 simplifications.
[2024-05-25 23:34:53] [INFO ] Flatten gal took : 13 ms
[2024-05-25 23:34:53] [INFO ] Flatten gal took : 10 ms
[2024-05-25 23:34:53] [INFO ] Input system was already deterministic with 146 transitions.
Computed a total of 133 stabilizing places and 146 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 133 transition count 146
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 4 formulas.
FORMULA NeoElection-COL-5-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 146/146 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 116 transition count 123
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 116 transition count 123
Applied a total of 34 rules in 8 ms. Remains 116 /133 variables (removed 17) and now considering 123/146 (removed 23) transitions.
[2024-05-25 23:34:53] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
// Phase 1: matrix 107 rows 116 cols
[2024-05-25 23:34:53] [INFO ] Computed 9 invariants in 1 ms
[2024-05-25 23:34:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-25 23:34:53] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2024-05-25 23:34:53] [INFO ] Invariant cache hit.
[2024-05-25 23:34:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 23:34:53] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-05-25 23:34:53] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2024-05-25 23:34:53] [INFO ] Invariant cache hit.
[2024-05-25 23:34:53] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 107/223 variables, 116/125 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 4/129 constraints. Problems are: Problem set: 1 solved, 117 unsolved
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 2 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-25 23:34:55] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-25 23:34:56] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-25 23:34:56] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 18/147 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 117 unsolved
[2024-05-25 23:34:56] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-25 23:34:56] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
[2024-05-25 23:34:56] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-25 23:34:56] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-25 23:34:56] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-25 23:34:57] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-25 23:34:57] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/223 variables, 7/154 constraints. Problems are: Problem set: 1 solved, 117 unsolved
[2024-05-25 23:34:57] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-25 23:34:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 2/156 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 117 unsolved
[2024-05-25 23:34:58] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-25 23:34:58] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/223 variables, 2/158 constraints. Problems are: Problem set: 1 solved, 117 unsolved
[2024-05-25 23:34:58] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-25 23:34:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 2/160 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 117 unsolved
[2024-05-25 23:35:00] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/223 variables, 1/161 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 16 (OVERLAPS) 0/223 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 161 constraints, problems are : Problem set: 1 solved, 117 unsolved in 7708 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 1 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 32/41 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 107/223 variables, 116/157 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 4/161 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 117/278 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/223 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 278 constraints, problems are : Problem set: 1 solved, 117 unsolved in 3577 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 117/118 constraints, Known Traps: 32/32 constraints]
After SMT, in 11345ms problems are : Problem set: 1 solved, 117 unsolved
Search for dead transitions found 1 dead transitions in 11348ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 116/133 places, 122/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11565 ms. Remains : 116/133 places, 122/146 transitions.
[2024-05-25 23:35:05] [INFO ] Flatten gal took : 7 ms
[2024-05-25 23:35:05] [INFO ] Flatten gal took : 8 ms
[2024-05-25 23:35:05] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-25 23:35:05] [INFO ] Flatten gal took : 7 ms
[2024-05-25 23:35:05] [INFO ] Flatten gal took : 8 ms
[2024-05-25 23:35:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality7697479007643919232.gal : 4 ms
[2024-05-25 23:35:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality10203001716000045951.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/CTLCardinality7697479007643919232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10203001716000045951.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,1.15077e+16,9.52455,265796,2,65135,5,1.33095e+06,6,0,572,1.29486e+06,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,9.5318,265796,1,0,6,1.33095e+06,7,1,819,1.29486e+06,1
FORMULA NeoElection-COL-5-CTLCardinality-2024-06 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 : 133/133 places, 146/146 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 121 transition count 128
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 121 transition count 128
Applied a total of 24 rules in 14 ms. Remains 121 /133 variables (removed 12) and now considering 128/146 (removed 18) transitions.
[2024-05-25 23:35:14] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
// Phase 1: matrix 112 rows 121 cols
[2024-05-25 23:35:14] [INFO ] Computed 9 invariants in 1 ms
[2024-05-25 23:35:14] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-25 23:35:14] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
[2024-05-25 23:35:14] [INFO ] Invariant cache hit.
[2024-05-25 23:35:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 23:35:15] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-25 23:35:15] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
[2024-05-25 23:35:15] [INFO ] Invariant cache hit.
[2024-05-25 23:35:15] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 5/121 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 112/233 variables, 121/130 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/134 constraints. Problems are: Problem set: 1 solved, 122 unsolved
[2024-05-25 23:35:16] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:35:16] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-25 23:35:16] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-25 23:35:16] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-25 23:35:16] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-25 23:35:16] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-25 23:35:16] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-25 23:35:16] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-25 23:35:16] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-25 23:35:16] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 4 ms to minimize.
[2024-05-25 23:35:16] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-25 23:35:17] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-25 23:35:17] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-25 23:35:17] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-25 23:35:17] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-25 23:35:17] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-25 23:35:17] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-25 23:35:17] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-25 23:35:17] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-25 23:35:17] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 20/154 constraints. Problems are: Problem set: 1 solved, 122 unsolved
[2024-05-25 23:35:18] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-25 23:35:18] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-25 23:35:18] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-25 23:35:18] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-25 23:35:18] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-25 23:35:18] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 6/160 constraints. Problems are: Problem set: 1 solved, 122 unsolved
[2024-05-25 23:35:18] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-25 23:35:18] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-25 23:35:18] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 3/163 constraints. Problems are: Problem set: 1 solved, 122 unsolved
[2024-05-25 23:35:18] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-25 23:35:19] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-25 23:35:19] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-25 23:35:19] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-25 23:35:19] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 5/168 constraints. Problems are: Problem set: 1 solved, 122 unsolved
[2024-05-25 23:35:19] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 122 unsolved
[2024-05-25 23:35:20] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-25 23:35:20] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/233 variables, 2/171 constraints. Problems are: Problem set: 1 solved, 122 unsolved
[2024-05-25 23:35:21] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 15 (OVERLAPS) 0/233 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 172 constraints, problems are : Problem set: 1 solved, 122 unsolved in 8266 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 1 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 5/121 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 38/47 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 112/233 variables, 121/168 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 4/172 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 122/294 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/294 constraints. Problems are: Problem set: 1 solved, 122 unsolved
[2024-05-25 23:35:25] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/233 variables, 1/295 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/295 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/233 variables, 0/295 constraints. Problems are: Problem set: 1 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 295 constraints, problems are : Problem set: 1 solved, 122 unsolved in 6355 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 122/123 constraints, Known Traps: 39/39 constraints]
After SMT, in 14661ms problems are : Problem set: 1 solved, 122 unsolved
Search for dead transitions found 1 dead transitions in 14671ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 121/133 places, 127/146 transitions.
Applied a total of 0 rules in 9 ms. Remains 121 /121 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14903 ms. Remains : 121/133 places, 127/146 transitions.
[2024-05-25 23:35:29] [INFO ] Flatten gal took : 11 ms
[2024-05-25 23:35:29] [INFO ] Flatten gal took : 8 ms
[2024-05-25 23:35:29] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-25 23:35:29] [INFO ] Flatten gal took : 7 ms
[2024-05-25 23:35:29] [INFO ] Flatten gal took : 7 ms
[2024-05-25 23:35:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality17355003805712525142.gal : 3 ms
[2024-05-25 23:35:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality6282720752159287423.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/CTLCardinality17355003805712525142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6282720752159287423.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,1.15077e+16,23.8399,629556,2,133877,5,2.79679e+06,6,0,597,3.25688e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-25 23:35:59] [INFO ] Flatten gal took : 11 ms
[2024-05-25 23:35:59] [INFO ] Applying decomposition
[2024-05-25 23:35:59] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1502257924033448163.txt' '-o' '/tmp/graph1502257924033448163.bin' '-w' '/tmp/graph1502257924033448163.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1502257924033448163.bin' '-l' '-1' '-v' '-w' '/tmp/graph1502257924033448163.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:35:59] [INFO ] Decomposing Gal with order
[2024-05-25 23:35:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:35:59] [INFO ] Removed a total of 153 redundant transitions.
[2024-05-25 23:36:00] [INFO ] Flatten gal took : 31 ms
[2024-05-25 23:36:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 17 ms.
[2024-05-25 23:36:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality13875521620073844773.gal : 5 ms
[2024-05-25 23:36:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality14569002529342207594.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/CTLCardinality13875521620073844773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14569002529342207594.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 146/146 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 116 transition count 123
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 116 transition count 123
Applied a total of 34 rules in 12 ms. Remains 116 /133 variables (removed 17) and now considering 123/146 (removed 23) transitions.
[2024-05-25 23:36:30] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
// Phase 1: matrix 107 rows 116 cols
[2024-05-25 23:36:30] [INFO ] Computed 9 invariants in 2 ms
[2024-05-25 23:36:30] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-25 23:36:30] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2024-05-25 23:36:30] [INFO ] Invariant cache hit.
[2024-05-25 23:36:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 23:36:30] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-05-25 23:36:30] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2024-05-25 23:36:30] [INFO ] Invariant cache hit.
[2024-05-25 23:36:30] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 107/223 variables, 116/125 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 4/129 constraints. Problems are: Problem set: 1 solved, 117 unsolved
[2024-05-25 23:36:31] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-25 23:36:31] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-25 23:36:31] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-25 23:36:31] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-25 23:36:31] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-25 23:36:31] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-25 23:36:32] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-25 23:36:32] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 4 ms to minimize.
[2024-05-25 23:36:32] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-25 23:36:32] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-25 23:36:32] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-25 23:36:32] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-25 23:36:32] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-25 23:36:32] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-25 23:36:32] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-25 23:36:32] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:36:32] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-25 23:36:32] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 18/147 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 117 unsolved
[2024-05-25 23:36:33] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-25 23:36:33] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-25 23:36:33] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-25 23:36:33] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-25 23:36:33] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-25 23:36:33] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:36:33] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/223 variables, 7/154 constraints. Problems are: Problem set: 1 solved, 117 unsolved
[2024-05-25 23:36:34] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-25 23:36:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 2/156 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 117 unsolved
[2024-05-25 23:36:35] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-25 23:36:35] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/223 variables, 2/158 constraints. Problems are: Problem set: 1 solved, 117 unsolved
[2024-05-25 23:36:35] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-25 23:36:35] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 2/160 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 117 unsolved
[2024-05-25 23:36:36] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/223 variables, 1/161 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 16 (OVERLAPS) 0/223 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 161 constraints, problems are : Problem set: 1 solved, 117 unsolved in 7826 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 1 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 32/41 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 107/223 variables, 116/157 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 4/161 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 117/278 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/223 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 278 constraints, problems are : Problem set: 1 solved, 117 unsolved in 3582 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 117/118 constraints, Known Traps: 32/32 constraints]
After SMT, in 11463ms problems are : Problem set: 1 solved, 117 unsolved
Search for dead transitions found 1 dead transitions in 11464ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 116/133 places, 122/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11677 ms. Remains : 116/133 places, 122/146 transitions.
[2024-05-25 23:36:41] [INFO ] Flatten gal took : 10 ms
[2024-05-25 23:36:41] [INFO ] Flatten gal took : 8 ms
[2024-05-25 23:36:41] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-25 23:36:41] [INFO ] Flatten gal took : 8 ms
[2024-05-25 23:36:41] [INFO ] Flatten gal took : 8 ms
[2024-05-25 23:36:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality2822820212902775406.gal : 1 ms
[2024-05-25 23:36:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality4910536321606138164.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/CTLCardinality2822820212902775406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4910536321606138164.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,1.15077e+16,11.2337,265956,2,65135,5,1.33095e+06,6,0,572,1.29486e+06,0
Converting to forward existential form...Done !
original formula: AG(AX(((((P_electionInit_1+P_electionInit_2)+(P_electionInit_3+P_electionInit_4))+P_electionInit_5)<=0)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(((((P_electionInit_1+P_electionInit_2)+(P_electionInit_3+P_electionInit_4))+P_election...177
(forward)formula 0,0,13.6077,265956,1,0,10,1.33095e+06,9,2,1092,1.29486e+06,2
FORMULA NeoElection-COL-5-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-05-25 23:36:55] [INFO ] Flatten gal took : 11 ms
[2024-05-25 23:36:55] [INFO ] Flatten gal took : 7 ms
[2024-05-25 23:36:55] [INFO ] Applying decomposition
[2024-05-25 23:36:55] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14683719516733722165.txt' '-o' '/tmp/graph14683719516733722165.bin' '-w' '/tmp/graph14683719516733722165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14683719516733722165.bin' '-l' '-1' '-v' '-w' '/tmp/graph14683719516733722165.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:36:55] [INFO ] Decomposing Gal with order
[2024-05-25 23:36:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:36:55] [INFO ] Removed a total of 235 redundant transitions.
[2024-05-25 23:36:55] [INFO ] Flatten gal took : 20 ms
[2024-05-25 23:36:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 12 ms.
[2024-05-25 23:36:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality6849859983821625291.gal : 3 ms
[2024-05-25 23:36:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality3136975997898220828.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/CTLCardinality6849859983821625291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3136975997898220828.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,2.31759e+16,189.78,3399792,2,671697,5,1.543e+07,6,0,685,1.79391e+07,0
Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
[2024-05-25 23:50:13] [INFO ] Applying decomposition
[2024-05-25 23:50:13] [INFO ] Flatten gal took : 13 ms
[2024-05-25 23:50:13] [INFO ] Decomposing Gal with order
[2024-05-25 23:50:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:50:13] [INFO ] Removed a total of 189 redundant transitions.
[2024-05-25 23:50:13] [INFO ] Flatten gal took : 13 ms
[2024-05-25 23:50:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 23:50:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality16445562684015205544.gal : 2 ms
[2024-05-25 23:50:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality2361262287153108297.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/CTLCardinality16445562684015205544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2361262287153108297.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,2.31759e+16,26.5021,592372,2,134599,5,3.08137e+06,6,0,664,2.7294e+06,0
Converting to forward existential form...Done !
original formula: AG(AF((EX(EX(((((gM1.P_electionInit_1+gM2.P_electionInit_2)+(gM3.P_electionInit_3+gM4.P_electionInit_4))+gM5.P_electionInit_5)>0))) + (((...402
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EX(EX(((((gM1.P_electionInit_1+gM2.P_electionInit_2)+(gM3.P_electionInit_3+gM4.P_electi...454
Reverse transition relation is NOT exact ! Due to transitions gM1.t0, gM2.t1, gM3.t2, gM4.t3, gM5.t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16...367
(forward)formula 0,0,756.733,14024996,1,0,616,8.34474e+07,11,156,1458,7.04508e+07,1
FORMULA NeoElection-COL-5-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Total runtime 1681635 ms.
BK_STOP 1716681771016
--------------------
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="NeoElection-COL-5"
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 NeoElection-COL-5, 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 r246-tall-171654351700465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-5.tgz
mv NeoElection-COL-5 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 '
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 ;