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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 8.7K Apr 11 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 11 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 18:20 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.2K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 8.8K Apr 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 18:36 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 75K 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-3-LTLCardinality-00
FORMULA_NAME NeoElection-COL-3-LTLCardinality-01
FORMULA_NAME NeoElection-COL-3-LTLCardinality-02
FORMULA_NAME NeoElection-COL-3-LTLCardinality-03
FORMULA_NAME NeoElection-COL-3-LTLCardinality-04
FORMULA_NAME NeoElection-COL-3-LTLCardinality-05
FORMULA_NAME NeoElection-COL-3-LTLCardinality-06
FORMULA_NAME NeoElection-COL-3-LTLCardinality-07
FORMULA_NAME NeoElection-COL-3-LTLCardinality-08
FORMULA_NAME NeoElection-COL-3-LTLCardinality-09
FORMULA_NAME NeoElection-COL-3-LTLCardinality-10
FORMULA_NAME NeoElection-COL-3-LTLCardinality-11
FORMULA_NAME NeoElection-COL-3-LTLCardinality-12
FORMULA_NAME NeoElection-COL-3-LTLCardinality-13
FORMULA_NAME NeoElection-COL-3-LTLCardinality-14
FORMULA_NAME NeoElection-COL-3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716679762184

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-25 23:29:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 23:29:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 23:29:23] [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:29:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 23:29:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 616 ms
[2024-05-25 23:29:24] [INFO ] Detected 6 constant HL places corresponding to 448 PT places.
[2024-05-25 23:29:24] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 972 PT places and 1808.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 23:29:24] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2024-05-25 23:29:24] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA NeoElection-COL-3-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Remains 13 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-3-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 40002 steps (1611 resets) in 767 ms. (52 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (1326 resets) in 460 ms. (86 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (413 resets) in 269 ms. (148 steps per ms) remains 2/2 properties
// Phase 1: matrix 7 rows 6 cols
[2024-05-25 23:29:24] [INFO ] Computed 1 invariants in 3 ms
[2024-05-25 23:29:24] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 6/13 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/6 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
FORMULA NeoElection-COL-3-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 23:29:25] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2024-05-25 23:29:25] [INFO ] Flatten gal took : 21 ms
FORMULA NeoElection-COL-3-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 23:29:25] [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(4), POS(3), M(4)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 3)]] 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:29:25] [INFO ] Unfolded HLPN to a Petri net with 972 places and 848 transitions 4688 arcs in 54 ms.
[2024-05-25 23:29:25] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 901 places and 790 transitions.
Reduce places removed 4 places and 0 transitions.
Support contains 33 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 58/58 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 58
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 58 transition count 49
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 58 transition count 49
Applied a total of 12 rules in 14 ms. Remains 58 /67 variables (removed 9) and now considering 49/58 (removed 9) transitions.
[2024-05-25 23:29:25] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
// Phase 1: matrix 45 rows 58 cols
[2024-05-25 23:29:25] [INFO ] Computed 14 invariants in 9 ms
[2024-05-25 23:29:25] [INFO ] Implicit Places using invariants in 95 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 104 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/67 places, 49/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 49/67 places, 49/58 transitions.
Support contains 33 out of 49 places after structural reductions.
[2024-05-25 23:29:25] [INFO ] Flatten gal took : 7 ms
[2024-05-25 23:29:25] [INFO ] Flatten gal took : 7 ms
[2024-05-25 23:29:25] [INFO ] Input system was already deterministic with 49 transitions.
RANDOM walk for 50 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/3 properties
Computed a total of 49 stabilizing places and 49 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 49
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 49/49 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 44 transition count 43
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 44 transition count 43
Applied a total of 10 rules in 3 ms. Remains 44 /49 variables (removed 5) and now considering 43/49 (removed 6) transitions.
[2024-05-25 23:29:25] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 44 cols
[2024-05-25 23:29:25] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 23:29:25] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-25 23:29:25] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
[2024-05-25 23:29:25] [INFO ] Invariant cache hit.
[2024-05-25 23:29:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 23:29:25] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-25 23:29:25] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
[2024-05-25 23:29:25] [INFO ] Invariant cache hit.
[2024-05-25 23:29:25] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 3/44 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem TDEAD5 is UNSAT
At refinement iteration 4 (OVERLAPS) 39/83 variables, 44/49 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 2/51 constraints. Problems are: Problem set: 1 solved, 39 unsolved
[2024-05-25 23:29:26] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 10 ms to minimize.
[2024-05-25 23:29:26] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
[2024-05-25 23:29:26] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-25 23:29:26] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-25 23:29:26] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-25 23:29:26] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-25 23:29:26] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 7/58 constraints. Problems are: Problem set: 1 solved, 39 unsolved
[2024-05-25 23:29:26] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 1/59 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/83 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 59 constraints, problems are : Problem set: 1 solved, 39 unsolved in 1088 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 3/44 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 8/13 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 39/83 variables, 44/57 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 2/59 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 39/98 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/83 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 98 constraints, problems are : Problem set: 1 solved, 39 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 39/40 constraints, Known Traps: 8/8 constraints]
After SMT, in 1646ms problems are : Problem set: 1 solved, 39 unsolved
Search for dead transitions found 1 dead transitions in 1648ms
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 : 44/49 places, 42/49 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1788 ms. Remains : 44/49 places, 42/49 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-3-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Computed a total of 44 stabilizing places and 42 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 42
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-3-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-3-LTLCardinality-01 finished in 2591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 24 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 49/49 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 46 transition count 46
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 46 transition count 46
Applied a total of 6 rules in 1 ms. Remains 46 /49 variables (removed 3) and now considering 46/49 (removed 3) transitions.
[2024-05-25 23:29:27] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 46 cols
[2024-05-25 23:29:27] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 23:29:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 23:29:28] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
[2024-05-25 23:29:28] [INFO ] Invariant cache hit.
[2024-05-25 23:29:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 23:29:28] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-25 23:29:28] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
[2024-05-25 23:29:28] [INFO ] Invariant cache hit.
[2024-05-25 23:29:28] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 3/46 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem TDEAD6 is UNSAT
At refinement iteration 4 (OVERLAPS) 42/88 variables, 46/51 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 3/54 constraints. Problems are: Problem set: 1 solved, 42 unsolved
[2024-05-25 23:29:28] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-25 23:29:28] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-25 23:29:28] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-25 23:29:28] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-25 23:29:28] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-25 23:29:28] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-25 23:29:28] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 7/61 constraints. Problems are: Problem set: 1 solved, 42 unsolved
[2024-05-25 23:29:28] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 1/62 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 0/88 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 62 constraints, problems are : Problem set: 1 solved, 42 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 46/46 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 3/46 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 8/13 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 42/88 variables, 46/59 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 3/62 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 42/104 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 0/88 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 104 constraints, problems are : Problem set: 1 solved, 42 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 46/46 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 42/43 constraints, Known Traps: 8/8 constraints]
After SMT, in 1487ms problems are : Problem set: 1 solved, 42 unsolved
Search for dead transitions found 1 dead transitions in 1488ms
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 : 46/49 places, 45/49 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1572 ms. Remains : 46/49 places, 45/49 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-3-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-3-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-3-LTLCardinality-06 finished in 1673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 49/49 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 49 transition count 46
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 46 transition count 46
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 46 transition count 43
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 43 transition count 43
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 41 transition count 40
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 41 transition count 40
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 35 transition count 34
Applied a total of 28 rules in 24 ms. Remains 35 /49 variables (removed 14) and now considering 34/49 (removed 15) transitions.
[2024-05-25 23:29:29] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 35 cols
[2024-05-25 23:29:29] [INFO ] Computed 5 invariants in 0 ms
[2024-05-25 23:29:29] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-25 23:29:29] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
[2024-05-25 23:29:29] [INFO ] Invariant cache hit.
[2024-05-25 23:29:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 23:29:29] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-25 23:29:29] [INFO ] Redundant transitions in 1 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-25 23:29:29] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
[2024-05-25 23:29:29] [INFO ] Invariant cache hit.
[2024-05-25 23:29:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 3/35 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem TDEAD17 is UNSAT
At refinement iteration 4 (OVERLAPS) 30/65 variables, 35/40 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/42 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 1 solved, 30 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 3/35 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 30/65 variables, 35/40 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/42 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 30/72 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 1 solved, 30 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 30/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 603ms problems are : Problem set: 1 solved, 30 unsolved
Search for dead transitions found 1 dead transitions in 604ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 35/49 places, 33/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-25 23:29:30] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 730 ms. Remains : 35/49 places, 33/49 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-3-LTLCardinality-15
Product exploration explored 100000 steps with 1923 reset in 246 ms.
Product exploration explored 100000 steps with 1923 reset in 207 ms.
Computed a total of 35 stabilizing places and 33 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35 transition count 33
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-3-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-3-LTLCardinality-15 finished in 1384 ms.
All properties solved by simple procedures.
Total runtime 7712 ms.

BK_STOP 1716679771399

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -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-3"
export BK_EXAMINATION="LTLCardinality"
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-3, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654351600451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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