About the Execution of LoLa+red for NeoElection-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 975.991 | 166895.00 | 198317.00 | 1241.20 | ?TTTFFT?FFFTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r263-smll-167863537800155.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is NeoElection-COL-7, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863537800155
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 9.5K Feb 26 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 19:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 19:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 18:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 108K Mar 5 18:23 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-7-LTLCardinality-00
FORMULA_NAME NeoElection-COL-7-LTLCardinality-01
FORMULA_NAME NeoElection-COL-7-LTLCardinality-02
FORMULA_NAME NeoElection-COL-7-LTLCardinality-03
FORMULA_NAME NeoElection-COL-7-LTLCardinality-04
FORMULA_NAME NeoElection-COL-7-LTLCardinality-05
FORMULA_NAME NeoElection-COL-7-LTLCardinality-06
FORMULA_NAME NeoElection-COL-7-LTLCardinality-07
FORMULA_NAME NeoElection-COL-7-LTLCardinality-08
FORMULA_NAME NeoElection-COL-7-LTLCardinality-09
FORMULA_NAME NeoElection-COL-7-LTLCardinality-10
FORMULA_NAME NeoElection-COL-7-LTLCardinality-11
FORMULA_NAME NeoElection-COL-7-LTLCardinality-12
FORMULA_NAME NeoElection-COL-7-LTLCardinality-13
FORMULA_NAME NeoElection-COL-7-LTLCardinality-14
FORMULA_NAME NeoElection-COL-7-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678728666932
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-7
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-13 17:31:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 17:31:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:31:10] [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.
[2023-03-13 17:31:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 17:31:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1205 ms
[2023-03-13 17:31:12] [INFO ] Detected 6 constant HL places corresponding to 3552 PT places.
[2023-03-13 17:31:12] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 7128 PT places and 22272.0 transition bindings in 50 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2023-03-13 17:31:12] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 9 ms.
[2023-03-13 17:31:12] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-7-LTLCardinality-10 FALSE 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 15 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-7-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Incomplete random walk after 10001 steps, including 231 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-03-13 17:31:13] [INFO ] Computed 1 place invariants in 5 ms
[2023-03-13 17:31:13] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-13 17:31:13] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
[2023-03-13 17:31:13] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2023-03-13 17:31:13] [INFO ] Flatten gal took : 36 ms
FORMULA NeoElection-COL-7-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 17:31:13] [INFO ] Flatten gal took : 4 ms
Domain [M(8), POS(7), M(8)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 7)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-13 17:31:13] [INFO ] Unfolded HLPN to a Petri net with 7128 places and 12460 transitions 70880 arcs in 414 ms.
[2023-03-13 17:31:13] [INFO ] Unfolded 7 HLPN properties in 6 ms.
Deduced a syphon composed of 6688 places in 54 ms
Reduce places removed 6737 places and 11850 transitions.
Reduce places removed 8 places and 0 transitions.
Support contains 238 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 610/610 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 341 transition count 610
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 77 place count 306 transition count 295
Iterating global reduction 1 with 35 rules applied. Total rules applied 112 place count 306 transition count 295
Applied a total of 112 rules in 44 ms. Remains 306 /383 variables (removed 77) and now considering 295/610 (removed 315) transitions.
[2023-03-13 17:31:14] [INFO ] Flow matrix only has 259 transitions (discarded 36 similar events)
// Phase 1: matrix 259 rows 306 cols
[2023-03-13 17:31:14] [INFO ] Computed 62 place invariants in 39 ms
[2023-03-13 17:31:14] [INFO ] Implicit Places using invariants in 379 ms returned [19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 386 ms to find 49 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/383 places, 295/610 transitions.
Applied a total of 0 rules in 2 ms. Remains 257 /257 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 433 ms. Remains : 257/383 places, 295/610 transitions.
Support contains 238 out of 257 places after structural reductions.
[2023-03-13 17:31:14] [INFO ] Flatten gal took : 55 ms
[2023-03-13 17:31:14] [INFO ] Flatten gal took : 43 ms
[2023-03-13 17:31:14] [INFO ] Input system was already deterministic with 295 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 17:31:15] [INFO ] Flow matrix only has 259 transitions (discarded 36 similar events)
// Phase 1: matrix 259 rows 257 cols
[2023-03-13 17:31:15] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-13 17:31:15] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-13 17:31:15] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
Computed a total of 257 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 257 transition count 295
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 7 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Reduce places removed 7 places and 7 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 250 transition count 281
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 243 transition count 281
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 51 place count 206 transition count 229
Iterating global reduction 0 with 37 rules applied. Total rules applied 88 place count 206 transition count 229
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 158 place count 171 transition count 194
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 165 place count 164 transition count 187
Applied a total of 165 rules in 86 ms. Remains 164 /257 variables (removed 93) and now considering 187/295 (removed 108) transitions.
[2023-03-13 17:31:15] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
// Phase 1: matrix 151 rows 164 cols
[2023-03-13 17:31:15] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-13 17:31:16] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-13 17:31:16] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:31:16] [INFO ] Invariant cache hit.
[2023-03-13 17:31:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:16] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2023-03-13 17:31:16] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-13 17:31:16] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:31:16] [INFO ] Invariant cache hit.
[2023-03-13 17:31:16] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/257 places, 187/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1094 ms. Remains : 164/257 places, 187/295 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s150 s151 s152 s153 s154 s155 s156) 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 290 reset in 907 ms.
Product exploration explored 100000 steps with 290 reset in 626 ms.
Computed a total of 164 stabilizing places and 187 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 187
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 : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2023-03-13 17:31:19] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:31:19] [INFO ] Invariant cache hit.
[2023-03-13 17:31:19] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:31:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:31:19] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-13 17:31:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:31:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:31:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:31:20] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-13 17:31:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:20] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-13 17:31:20] [INFO ] Computed and/alt/rep : 180/369/144 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-13 17:31:20] [INFO ] Added : 59 causal constraints over 12 iterations in 373 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 187/187 transitions.
Applied a total of 0 rules in 16 ms. Remains 164 /164 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2023-03-13 17:31:20] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:31:20] [INFO ] Invariant cache hit.
[2023-03-13 17:31:20] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-13 17:31:20] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:31:20] [INFO ] Invariant cache hit.
[2023-03-13 17:31:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:21] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-13 17:31:21] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-13 17:31:21] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:31:21] [INFO ] Invariant cache hit.
[2023-03-13 17:31:21] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 603 ms. Remains : 164/164 places, 187/187 transitions.
Computed a total of 164 stabilizing places and 187 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 187
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 : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 259 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-13 17:31:21] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:31:21] [INFO ] Invariant cache hit.
[2023-03-13 17:31:22] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-13 17:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:31:22] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-13 17:31:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:31:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-13 17:31:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:31:22] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2023-03-13 17:31:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-13 17:31:22] [INFO ] Computed and/alt/rep : 180/369/144 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-13 17:31:22] [INFO ] Added : 59 causal constraints over 12 iterations in 312 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 290 reset in 653 ms.
Product exploration explored 100000 steps with 290 reset in 477 ms.
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 187/187 transitions.
Applied a total of 0 rules in 9 ms. Remains 164 /164 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2023-03-13 17:31:24] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:31:24] [INFO ] Invariant cache hit.
[2023-03-13 17:31:24] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-13 17:31:24] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:31:24] [INFO ] Invariant cache hit.
[2023-03-13 17:31:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:24] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2023-03-13 17:31:24] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 17:31:24] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:31:24] [INFO ] Invariant cache hit.
[2023-03-13 17:31:25] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 866 ms. Remains : 164/164 places, 187/187 transitions.
Treatment of property NeoElection-COL-7-LTLCardinality-00 finished in 9526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p0))&&X(X(p0)))))'
Support contains 49 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 227 transition count 250
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 227 transition count 250
Applied a total of 60 rules in 14 ms. Remains 227 /257 variables (removed 30) and now considering 250/295 (removed 45) transitions.
[2023-03-13 17:31:25] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
// Phase 1: matrix 214 rows 227 cols
[2023-03-13 17:31:25] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-13 17:31:25] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-13 17:31:25] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2023-03-13 17:31:25] [INFO ] Invariant cache hit.
[2023-03-13 17:31:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:25] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2023-03-13 17:31:25] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2023-03-13 17:31:25] [INFO ] Invariant cache hit.
[2023-03-13 17:31:26] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/257 places, 250/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 831 ms. Remains : 227/257 places, 250/295 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 (ADD s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 637 ms.
Product exploration explored 100000 steps with 25000 reset in 254 ms.
Computed a total of 227 stabilizing places and 250 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 227 transition count 250
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 : [(NOT p0), (X p0), true, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 354 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
[2023-03-13 17:31:28] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2023-03-13 17:31:28] [INFO ] Invariant cache hit.
[2023-03-13 17:31:28] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-13 17:31:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:31:29] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2023-03-13 17:31:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:31:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:31:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:31:29] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2023-03-13 17:31:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:29] [INFO ] [Nat]Added 6 Read/Feed constraints in 8 ms returned sat
[2023-03-13 17:31:29] [INFO ] Computed and/alt/rep : 236/510/200 causal constraints (skipped 7 transitions) in 29 ms.
[2023-03-13 17:31:30] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 11 ms to minimize.
[2023-03-13 17:31:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-03-13 17:31:30] [INFO ] Added : 27 causal constraints over 6 iterations in 599 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 49 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-13 17:31:30] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2023-03-13 17:31:30] [INFO ] Invariant cache hit.
[2023-03-13 17:31:30] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-13 17:31:30] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2023-03-13 17:31:30] [INFO ] Invariant cache hit.
[2023-03-13 17:31:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:31] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2023-03-13 17:31:31] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2023-03-13 17:31:31] [INFO ] Invariant cache hit.
[2023-03-13 17:31:31] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1100 ms. Remains : 227/227 places, 250/250 transitions.
Computed a total of 227 stabilizing places and 250 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 227 transition count 250
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 : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
[2023-03-13 17:31:32] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2023-03-13 17:31:32] [INFO ] Invariant cache hit.
[2023-03-13 17:31:33] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:31:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:31:33] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2023-03-13 17:31:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:31:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:31:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:31:34] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2023-03-13 17:31:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:34] [INFO ] [Nat]Added 6 Read/Feed constraints in 8 ms returned sat
[2023-03-13 17:31:34] [INFO ] Computed and/alt/rep : 236/510/200 causal constraints (skipped 7 transitions) in 29 ms.
[2023-03-13 17:31:34] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 2 ms to minimize.
[2023-03-13 17:31:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-13 17:31:34] [INFO ] Added : 27 causal constraints over 6 iterations in 553 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 345 ms.
Product exploration explored 100000 steps with 25000 reset in 375 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 305 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 49 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 250/250 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 227 transition count 250
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 220 transition count 243
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 220 transition count 243
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 28 rules in 59 ms. Remains 220 /227 variables (removed 7) and now considering 243/250 (removed 7) transitions.
[2023-03-13 17:31:36] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-13 17:31:36] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
// Phase 1: matrix 207 rows 220 cols
[2023-03-13 17:31:36] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-13 17:31:36] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 220/227 places, 243/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 220/227 places, 243/250 transitions.
Support contains 49 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-13 17:31:36] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
// Phase 1: matrix 214 rows 227 cols
[2023-03-13 17:31:36] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-13 17:31:36] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-13 17:31:36] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2023-03-13 17:31:36] [INFO ] Invariant cache hit.
[2023-03-13 17:31:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:37] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2023-03-13 17:31:37] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2023-03-13 17:31:37] [INFO ] Invariant cache hit.
[2023-03-13 17:31:37] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1002 ms. Remains : 227/227 places, 250/250 transitions.
Treatment of property NeoElection-COL-7-LTLCardinality-02 finished in 12367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 168 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 250 transition count 288
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 250 transition count 288
Applied a total of 14 rules in 5 ms. Remains 250 /257 variables (removed 7) and now considering 288/295 (removed 7) transitions.
[2023-03-13 17:31:37] [INFO ] Flow matrix only has 252 transitions (discarded 36 similar events)
// Phase 1: matrix 252 rows 250 cols
[2023-03-13 17:31:37] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-13 17:31:37] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-13 17:31:37] [INFO ] Flow matrix only has 252 transitions (discarded 36 similar events)
[2023-03-13 17:31:37] [INFO ] Invariant cache hit.
[2023-03-13 17:31:37] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-13 17:31:38] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-13 17:31:38] [INFO ] Flow matrix only has 252 transitions (discarded 36 similar events)
[2023-03-13 17:31:38] [INFO ] Invariant cache hit.
[2023-03-13 17:31:38] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 250/257 places, 288/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 857 ms. Remains : 250/257 places, 288/295 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 19906 reset in 639 ms.
Product exploration explored 100000 steps with 19889 reset in 498 ms.
Computed a total of 250 stabilizing places and 288 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 250 transition count 288
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 : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-13 17:31:40] [INFO ] Flow matrix only has 252 transitions (discarded 36 similar events)
[2023-03-13 17:31:40] [INFO ] Invariant cache hit.
[2023-03-13 17:31:40] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:31:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:31:41] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2023-03-13 17:31:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:31:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-13 17:31:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:31:41] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2023-03-13 17:31:41] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-13 17:31:41] [INFO ] [Nat]Added 21 Read/Feed constraints in 12 ms returned sat
[2023-03-13 17:31:42] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 3 ms to minimize.
[2023-03-13 17:31:42] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 2 ms to minimize.
[2023-03-13 17:31:42] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 3 ms to minimize.
[2023-03-13 17:31:42] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 1 ms to minimize.
[2023-03-13 17:31:43] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 1 ms to minimize.
[2023-03-13 17:31:43] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 1 ms to minimize.
[2023-03-13 17:31:43] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 1 ms to minimize.
[2023-03-13 17:31:43] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 2 ms to minimize.
[2023-03-13 17:31:44] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-03-13 17:31:44] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2023-03-13 17:31:44] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2023-03-13 17:31:44] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 2 ms to minimize.
[2023-03-13 17:31:44] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2023-03-13 17:31:45] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2023-03-13 17:31:45] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3189 ms
[2023-03-13 17:31:45] [INFO ] Computed and/alt/rep : 262/656/232 causal constraints (skipped 13 transitions) in 34 ms.
[2023-03-13 17:31:45] [INFO ] Added : 0 causal constraints over 0 iterations in 82 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 168 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 288/288 transitions.
Reduce places removed 7 places and 7 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 243 transition count 274
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 236 transition count 274
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 236 transition count 267
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 229 transition count 267
Applied a total of 28 rules in 39 ms. Remains 229 /250 variables (removed 21) and now considering 267/288 (removed 21) transitions.
[2023-03-13 17:31:45] [INFO ] Flow matrix only has 231 transitions (discarded 36 similar events)
// Phase 1: matrix 231 rows 229 cols
[2023-03-13 17:31:45] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-13 17:31:45] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-13 17:31:45] [INFO ] Flow matrix only has 231 transitions (discarded 36 similar events)
[2023-03-13 17:31:45] [INFO ] Invariant cache hit.
[2023-03-13 17:31:45] [INFO ] State equation strengthened by 189 read => feed constraints.
[2023-03-13 17:31:45] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2023-03-13 17:31:45] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-13 17:31:45] [INFO ] Flow matrix only has 231 transitions (discarded 36 similar events)
[2023-03-13 17:31:45] [INFO ] Invariant cache hit.
[2023-03-13 17:31:46] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 229/250 places, 267/288 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 955 ms. Remains : 229/250 places, 267/288 transitions.
Computed a total of 229 stabilizing places and 267 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 229 transition count 267
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 : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-7-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLCardinality-03 finished in 8886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 7 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Reduce places removed 7 places and 7 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 250 transition count 281
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 243 transition count 281
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 44 place count 213 transition count 236
Iterating global reduction 0 with 30 rules applied. Total rules applied 74 place count 213 transition count 236
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 158 place count 171 transition count 194
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 165 place count 164 transition count 187
Applied a total of 165 rules in 103 ms. Remains 164 /257 variables (removed 93) and now considering 187/295 (removed 108) transitions.
[2023-03-13 17:31:46] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
// Phase 1: matrix 151 rows 164 cols
[2023-03-13 17:31:46] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-13 17:31:46] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-13 17:31:46] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:31:46] [INFO ] Invariant cache hit.
[2023-03-13 17:31:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:47] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
[2023-03-13 17:31:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 17:31:47] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:31:47] [INFO ] Invariant cache hit.
[2023-03-13 17:31:47] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/257 places, 187/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1298 ms. Remains : 164/257 places, 187/295 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s150 s151 s152 s153 s154 s155 s156))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 23916 reset in 749 ms.
Product exploration explored 100000 steps with 23911 reset in 984 ms.
Computed a total of 164 stabilizing places and 187 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 187
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 232 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-13 17:31:50] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:31:50] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-7-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLCardinality-05 finished in 4099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(G(!p0))))))'
Support contains 7 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 220 transition count 243
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 220 transition count 243
Applied a total of 74 rules in 17 ms. Remains 220 /257 variables (removed 37) and now considering 243/295 (removed 52) transitions.
[2023-03-13 17:31:50] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
// Phase 1: matrix 207 rows 220 cols
[2023-03-13 17:31:50] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-13 17:31:50] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-13 17:31:50] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:31:50] [INFO ] Invariant cache hit.
[2023-03-13 17:31:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:51] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2023-03-13 17:31:51] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:31:51] [INFO ] Invariant cache hit.
[2023-03-13 17:31:51] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 220/257 places, 243/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1125 ms. Remains : 220/257 places, 243/295 transitions.
Stuttering acceptance computed with spot in 250 ms :[true, true, true, (NOT p0), p0]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT (ADD s171 s172 s173 s174 s175 s176 s177) 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 342 reset in 677 ms.
Product exploration explored 100000 steps with 342 reset in 628 ms.
Computed a total of 220 stabilizing places and 243 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 220 transition count 243
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 : [(NOT p0), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Knowledge obtained : [(NOT p0), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 257 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-13 17:31:54] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:31:54] [INFO ] Invariant cache hit.
[2023-03-13 17:31:54] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:31:54] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2023-03-13 17:31:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:31:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:31:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:31:55] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2023-03-13 17:31:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:55] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2023-03-13 17:31:55] [INFO ] Computed and/alt/rep : 229/496/193 causal constraints (skipped 7 transitions) in 27 ms.
[2023-03-13 17:31:56] [INFO ] Added : 119 causal constraints over 24 iterations in 808 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 243/243 transitions.
Applied a total of 0 rules in 7 ms. Remains 220 /220 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2023-03-13 17:31:56] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:31:56] [INFO ] Invariant cache hit.
[2023-03-13 17:31:56] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-13 17:31:56] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:31:56] [INFO ] Invariant cache hit.
[2023-03-13 17:31:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:57] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2023-03-13 17:31:57] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:31:57] [INFO ] Invariant cache hit.
[2023-03-13 17:31:57] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 905 ms. Remains : 220/220 places, 243/243 transitions.
Computed a total of 220 stabilizing places and 243 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 220 transition count 243
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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 236 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-13 17:31:58] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:31:58] [INFO ] Invariant cache hit.
[2023-03-13 17:31:58] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-13 17:31:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:31:58] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2023-03-13 17:31:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:31:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:31:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:31:59] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2023-03-13 17:31:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:31:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2023-03-13 17:31:59] [INFO ] Computed and/alt/rep : 229/496/193 causal constraints (skipped 7 transitions) in 32 ms.
[2023-03-13 17:32:00] [INFO ] Added : 119 causal constraints over 24 iterations in 720 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2993 reset in 322 ms.
Product exploration explored 100000 steps with 2991 reset in 367 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 7 out of 220 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 220/220 places, 243/243 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 220 transition count 243
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 42 place count 220 transition count 243
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 42 rules in 34 ms. Remains 220 /220 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2023-03-13 17:32:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 17:32:01] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
// Phase 1: matrix 207 rows 220 cols
[2023-03-13 17:32:01] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-13 17:32:01] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 220/220 places, 243/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 369 ms. Remains : 220/220 places, 243/243 transitions.
Support contains 7 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 243/243 transitions.
Applied a total of 0 rules in 4 ms. Remains 220 /220 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2023-03-13 17:32:01] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
// Phase 1: matrix 207 rows 220 cols
[2023-03-13 17:32:01] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-13 17:32:01] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-13 17:32:01] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:32:01] [INFO ] Invariant cache hit.
[2023-03-13 17:32:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:32:02] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-13 17:32:02] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:32:02] [INFO ] Invariant cache hit.
[2023-03-13 17:32:02] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1012 ms. Remains : 220/220 places, 243/243 transitions.
Treatment of property NeoElection-COL-7-LTLCardinality-07 finished in 12156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 168 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Reduce places removed 7 places and 7 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 250 transition count 281
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 243 transition count 281
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 236 transition count 274
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 236 transition count 274
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 28 place count 236 transition count 267
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 42 place count 229 transition count 267
Applied a total of 42 rules in 37 ms. Remains 229 /257 variables (removed 28) and now considering 267/295 (removed 28) transitions.
[2023-03-13 17:32:02] [INFO ] Flow matrix only has 231 transitions (discarded 36 similar events)
// Phase 1: matrix 231 rows 229 cols
[2023-03-13 17:32:02] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-13 17:32:02] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-13 17:32:02] [INFO ] Flow matrix only has 231 transitions (discarded 36 similar events)
[2023-03-13 17:32:02] [INFO ] Invariant cache hit.
[2023-03-13 17:32:03] [INFO ] State equation strengthened by 189 read => feed constraints.
[2023-03-13 17:32:03] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-13 17:32:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 17:32:03] [INFO ] Flow matrix only has 231 transitions (discarded 36 similar events)
[2023-03-13 17:32:03] [INFO ] Invariant cache hit.
[2023-03-13 17:32:03] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 229/257 places, 267/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 833 ms. Remains : 229/257 places, 267/295 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33333 reset in 806 ms.
Product exploration explored 100000 steps with 33333 reset in 670 ms.
Computed a total of 229 stabilizing places and 267 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 229 transition count 267
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 : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-7-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLCardinality-11 finished in 2640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 175 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Reduce places removed 7 places and 7 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 243 transition count 281
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 243 transition count 281
Applied a total of 14 rules in 16 ms. Remains 243 /257 variables (removed 14) and now considering 281/295 (removed 14) transitions.
[2023-03-13 17:32:05] [INFO ] Flow matrix only has 245 transitions (discarded 36 similar events)
// Phase 1: matrix 245 rows 243 cols
[2023-03-13 17:32:05] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-13 17:32:05] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-13 17:32:05] [INFO ] Flow matrix only has 245 transitions (discarded 36 similar events)
[2023-03-13 17:32:05] [INFO ] Invariant cache hit.
[2023-03-13 17:32:05] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-13 17:32:05] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-13 17:32:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 17:32:05] [INFO ] Flow matrix only has 245 transitions (discarded 36 similar events)
[2023-03-13 17:32:05] [INFO ] Invariant cache hit.
[2023-03-13 17:32:06] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/257 places, 281/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 800 ms. Remains : 243/257 places, 281/295 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(OR (AND (LEQ (ADD s194 s195 s196 s197 s198 s199 s200) (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3556 reset in 2140 ms.
Product exploration explored 100000 steps with 3545 reset in 1802 ms.
Computed a total of 243 stabilizing places and 281 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 281
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 : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 446 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 17:32:11] [INFO ] Flow matrix only has 245 transitions (discarded 36 similar events)
[2023-03-13 17:32:11] [INFO ] Invariant cache hit.
[2023-03-13 17:32:11] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (F (G (NOT p1))), (F (G p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 10 factoid took 400 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-7-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLCardinality-12 finished in 6295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p0))&&X(X(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(G(!p0))))))'
Found a Shortening insensitive property : NeoElection-COL-7-LTLCardinality-07
Stuttering acceptance computed with spot in 246 ms :[true, true, true, (NOT p0), p0]
Support contains 7 out of 257 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Reduce places removed 7 places and 7 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 213 transition count 236
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 213 transition count 236
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 144 place count 178 transition count 201
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 151 place count 171 transition count 194
Applied a total of 151 rules in 40 ms. Remains 171 /257 variables (removed 86) and now considering 194/295 (removed 101) transitions.
[2023-03-13 17:32:12] [INFO ] Flow matrix only has 158 transitions (discarded 36 similar events)
// Phase 1: matrix 158 rows 171 cols
[2023-03-13 17:32:12] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-13 17:32:12] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-13 17:32:12] [INFO ] Flow matrix only has 158 transitions (discarded 36 similar events)
[2023-03-13 17:32:12] [INFO ] Invariant cache hit.
[2023-03-13 17:32:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:32:13] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2023-03-13 17:32:13] [INFO ] Flow matrix only has 158 transitions (discarded 36 similar events)
[2023-03-13 17:32:13] [INFO ] Invariant cache hit.
[2023-03-13 17:32:13] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 171/257 places, 194/295 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 954 ms. Remains : 171/257 places, 194/295 transitions.
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT (ADD s164 s165 s166 s167 s168 s169 s170) 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 210 reset in 550 ms.
Product exploration explored 100000 steps with 204 reset in 358 ms.
Computed a total of 171 stabilizing places and 194 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 171 transition count 194
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 : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 258 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-13 17:32:15] [INFO ] Flow matrix only has 158 transitions (discarded 36 similar events)
[2023-03-13 17:32:15] [INFO ] Invariant cache hit.
[2023-03-13 17:32:15] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-13 17:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:32:15] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2023-03-13 17:32:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:32:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-13 17:32:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:32:15] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2023-03-13 17:32:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:32:15] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-13 17:32:16] [INFO ] Computed and/alt/rep : 187/376/151 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-13 17:32:16] [INFO ] Added : 54 causal constraints over 11 iterations in 275 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-13 17:32:16] [INFO ] Flow matrix only has 158 transitions (discarded 36 similar events)
[2023-03-13 17:32:16] [INFO ] Invariant cache hit.
[2023-03-13 17:32:16] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-13 17:32:16] [INFO ] Flow matrix only has 158 transitions (discarded 36 similar events)
[2023-03-13 17:32:16] [INFO ] Invariant cache hit.
[2023-03-13 17:32:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:32:16] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2023-03-13 17:32:16] [INFO ] Flow matrix only has 158 transitions (discarded 36 similar events)
[2023-03-13 17:32:16] [INFO ] Invariant cache hit.
[2023-03-13 17:32:17] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 859 ms. Remains : 171/171 places, 194/194 transitions.
Computed a total of 171 stabilizing places and 194 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 171 transition count 194
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 : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-13 17:32:18] [INFO ] Flow matrix only has 158 transitions (discarded 36 similar events)
[2023-03-13 17:32:18] [INFO ] Invariant cache hit.
[2023-03-13 17:32:18] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-13 17:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:32:18] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2023-03-13 17:32:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:32:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-13 17:32:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:32:18] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2023-03-13 17:32:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:32:18] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-13 17:32:19] [INFO ] Computed and/alt/rep : 187/376/151 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-13 17:32:19] [INFO ] Added : 54 causal constraints over 11 iterations in 274 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 31154 reset in 470 ms.
Product exploration explored 100000 steps with 31124 reset in 540 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 7 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 194/194 transitions.
Applied a total of 0 rules in 10 ms. Remains 171 /171 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-13 17:32:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 17:32:20] [INFO ] Flow matrix only has 158 transitions (discarded 36 similar events)
[2023-03-13 17:32:20] [INFO ] Invariant cache hit.
[2023-03-13 17:32:21] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 171/171 places, 194/194 transitions.
Support contains 7 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-13 17:32:21] [INFO ] Flow matrix only has 158 transitions (discarded 36 similar events)
[2023-03-13 17:32:21] [INFO ] Invariant cache hit.
[2023-03-13 17:32:21] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-13 17:32:21] [INFO ] Flow matrix only has 158 transitions (discarded 36 similar events)
[2023-03-13 17:32:21] [INFO ] Invariant cache hit.
[2023-03-13 17:32:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:32:21] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2023-03-13 17:32:21] [INFO ] Flow matrix only has 158 transitions (discarded 36 similar events)
[2023-03-13 17:32:21] [INFO ] Invariant cache hit.
[2023-03-13 17:32:21] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 908 ms. Remains : 171/171 places, 194/194 transitions.
Treatment of property NeoElection-COL-7-LTLCardinality-07 finished in 10016 ms.
[2023-03-13 17:32:22] [INFO ] Flatten gal took : 45 ms
[2023-03-13 17:32:22] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-13 17:32:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 257 places, 295 transitions and 1247 arcs took 7 ms.
Total runtime 71447 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NeoElection-COL-7
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/365
LTLCardinality
FORMULA NeoElection-COL-7-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678728833827
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/365/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/365/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/365/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 NeoElection-COL-7-LTLCardinality-00
lola: time limit : 900 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/900 4/32 NeoElection-COL-7-LTLCardinality-00 460956 m, 92191 m/sec, 2771646 t fired, .
Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/900 8/32 NeoElection-COL-7-LTLCardinality-00 908468 m, 89502 m/sec, 5669365 t fired, .
Time elapsed: 10 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/900 11/32 NeoElection-COL-7-LTLCardinality-00 1324768 m, 83260 m/sec, 8522389 t fired, .
Time elapsed: 15 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/900 14/32 NeoElection-COL-7-LTLCardinality-00 1765657 m, 88177 m/sec, 11406993 t fired, .
Time elapsed: 20 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/900 17/32 NeoElection-COL-7-LTLCardinality-00 2175902 m, 82049 m/sec, 14269279 t fired, .
Time elapsed: 25 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/900 20/32 NeoElection-COL-7-LTLCardinality-00 2557028 m, 76225 m/sec, 17094438 t fired, .
Time elapsed: 30 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/900 24/32 NeoElection-COL-7-LTLCardinality-00 2999576 m, 88509 m/sec, 19979444 t fired, .
Time elapsed: 35 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/900 27/32 NeoElection-COL-7-LTLCardinality-00 3412850 m, 82654 m/sec, 22864438 t fired, .
Time elapsed: 40 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/900 30/32 NeoElection-COL-7-LTLCardinality-00 3806788 m, 78787 m/sec, 25712887 t fired, .
Time elapsed: 45 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for NeoElection-COL-7-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 11 (type EXCL) for 10 NeoElection-COL-7-LTLCardinality-07
lola: time limit : 1183 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/1183 7/32 NeoElection-COL-7-LTLCardinality-07 740281 m, 148056 m/sec, 2334693 t fired, .
Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/1183 12/32 NeoElection-COL-7-LTLCardinality-07 1393547 m, 130653 m/sec, 4794641 t fired, .
Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 15/1183 18/32 NeoElection-COL-7-LTLCardinality-07 2049011 m, 131092 m/sec, 7265229 t fired, .
Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 20/1183 24/32 NeoElection-COL-7-LTLCardinality-07 2693020 m, 128801 m/sec, 9760303 t fired, .
Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 25/1183 28/32 NeoElection-COL-7-LTLCardinality-07 3192016 m, 99799 m/sec, 12318090 t fired, .
Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 30/1183 30/32 NeoElection-COL-7-LTLCardinality-07 3460791 m, 53755 m/sec, 14910406 t fired, .
Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 35/1183 32/32 NeoElection-COL-7-LTLCardinality-07 3725024 m, 52846 m/sec, 17486196 t fired, .
Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 11 (type EXCL) for NeoElection-COL-7-LTLCardinality-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
NeoElection-COL-7-LTLCardinality-02: CONJ 0 2 0 0 2 0 0 0
NeoElection-COL-7-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 8 (type EXCL) for 3 NeoElection-COL-7-LTLCardinality-02
lola: time limit : 1755 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for NeoElection-COL-7-LTLCardinality-02
lola: result : true
lola: markings : 120
lola: fired transitions : 252
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 6 (type EXCL) for 3 NeoElection-COL-7-LTLCardinality-02
lola: time limit : 3510 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for NeoElection-COL-7-LTLCardinality-02
lola: result : true
lola: markings : 36
lola: fired transitions : 56
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 3
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NeoElection-COL-7-LTLCardinality-00: LTL unknown AGGR
NeoElection-COL-7-LTLCardinality-02: CONJ true CONJ
NeoElection-COL-7-LTLCardinality-07: LTL unknown AGGR
Time elapsed: 90 secs. Pages in use: 32
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-7"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is NeoElection-COL-7, 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 r263-smll-167863537800155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-7.tgz
mv NeoElection-COL-7 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 '
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 ;