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.r455-smll-167912647700683.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 StigmergyElection-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r455-smll-167912647700683
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 9.4K Feb 26 16:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 16:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 16:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 16:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 50M 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 StigmergyElection-PT-10a-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679341116304

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=StigmergyElection-PT-10a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 19:38:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 19:38:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:38:42] [INFO ] Load time of PNML (sax parser for PT used): 3260 ms
[2023-03-20 19:38:42] [INFO ] Transformed 142 places.
[2023-03-20 19:38:43] [INFO ] Transformed 50162 transitions.
[2023-03-20 19:38:43] [INFO ] Found NUPN structural information;
[2023-03-20 19:38:43] [INFO ] Parsed PT model containing 142 places and 50162 transitions and 999212 arcs in 3964 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyElection-PT-10a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 2238/2238 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 130 transition count 2220
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 130 transition count 2220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 126 transition count 2212
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 126 transition count 2212
Applied a total of 32 rules in 632 ms. Remains 126 /142 variables (removed 16) and now considering 2212/2238 (removed 26) transitions.
[2023-03-20 19:38:44] [INFO ] Flow matrix only has 2194 transitions (discarded 18 similar events)
// Phase 1: matrix 2194 rows 126 cols
[2023-03-20 19:38:44] [INFO ] Computed 5 place invariants in 91 ms
[2023-03-20 19:38:46] [INFO ] Implicit Places using invariants in 1368 ms returned []
[2023-03-20 19:38:46] [INFO ] Flow matrix only has 2194 transitions (discarded 18 similar events)
[2023-03-20 19:38:46] [INFO ] Invariant cache hit.
[2023-03-20 19:38:47] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:38:47] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 2956 ms to find 0 implicit places.
[2023-03-20 19:38:47] [INFO ] Flow matrix only has 2194 transitions (discarded 18 similar events)
[2023-03-20 19:38:47] [INFO ] Invariant cache hit.
[2023-03-20 19:38:49] [INFO ] Dead Transitions using invariants and state equation in 1457 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/142 places, 2212/2238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5066 ms. Remains : 126/142 places, 2212/2238 transitions.
Support contains 31 out of 126 places after structural reductions.
[2023-03-20 19:38:49] [INFO ] Flatten gal took : 453 ms
[2023-03-20 19:38:50] [INFO ] Flatten gal took : 275 ms
[2023-03-20 19:38:50] [INFO ] Input system was already deterministic with 2212 transitions.
Support contains 30 out of 126 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1831 ms. (steps per millisecond=5 ) properties (out of 20) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 19:38:52] [INFO ] Flow matrix only has 2194 transitions (discarded 18 similar events)
[2023-03-20 19:38:52] [INFO ] Invariant cache hit.
[2023-03-20 19:38:52] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-20 19:38:52] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 19:38:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-20 19:38:53] [INFO ] After 912ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 19:38:54] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:38:55] [INFO ] After 767ms SMT Verify possible using 2095 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 19:38:56] [INFO ] Deduced a trap composed of 13 places in 1159 ms of which 4 ms to minimize.
[2023-03-20 19:38:57] [INFO ] Deduced a trap composed of 10 places in 912 ms of which 1 ms to minimize.
[2023-03-20 19:38:58] [INFO ] Deduced a trap composed of 14 places in 772 ms of which 3 ms to minimize.
[2023-03-20 19:38:59] [INFO ] Deduced a trap composed of 10 places in 783 ms of which 1 ms to minimize.
[2023-03-20 19:39:00] [INFO ] Deduced a trap composed of 12 places in 658 ms of which 1 ms to minimize.
[2023-03-20 19:39:00] [INFO ] Deduced a trap composed of 13 places in 526 ms of which 1 ms to minimize.
[2023-03-20 19:39:01] [INFO ] Deduced a trap composed of 14 places in 536 ms of which 1 ms to minimize.
[2023-03-20 19:39:01] [INFO ] Deduced a trap composed of 12 places in 427 ms of which 5 ms to minimize.
[2023-03-20 19:39:02] [INFO ] Deduced a trap composed of 12 places in 417 ms of which 1 ms to minimize.
[2023-03-20 19:39:02] [INFO ] Deduced a trap composed of 12 places in 399 ms of which 1 ms to minimize.
[2023-03-20 19:39:03] [INFO ] Deduced a trap composed of 12 places in 351 ms of which 1 ms to minimize.
[2023-03-20 19:39:03] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 1 ms to minimize.
[2023-03-20 19:39:03] [INFO ] Deduced a trap composed of 12 places in 346 ms of which 1 ms to minimize.
[2023-03-20 19:39:04] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 1 ms to minimize.
[2023-03-20 19:39:04] [INFO ] Deduced a trap composed of 12 places in 321 ms of which 0 ms to minimize.
[2023-03-20 19:39:04] [INFO ] Deduced a trap composed of 12 places in 267 ms of which 1 ms to minimize.
[2023-03-20 19:39:05] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 1 ms to minimize.
[2023-03-20 19:39:05] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 9896 ms
[2023-03-20 19:39:06] [INFO ] Deduced a trap composed of 11 places in 830 ms of which 1 ms to minimize.
[2023-03-20 19:39:07] [INFO ] Deduced a trap composed of 12 places in 735 ms of which 1 ms to minimize.
[2023-03-20 19:39:08] [INFO ] Deduced a trap composed of 12 places in 760 ms of which 1 ms to minimize.
[2023-03-20 19:39:08] [INFO ] Deduced a trap composed of 12 places in 591 ms of which 2 ms to minimize.
[2023-03-20 19:39:09] [INFO ] Deduced a trap composed of 13 places in 525 ms of which 1 ms to minimize.
[2023-03-20 19:39:10] [INFO ] Deduced a trap composed of 13 places in 500 ms of which 0 ms to minimize.
[2023-03-20 19:39:10] [INFO ] Deduced a trap composed of 13 places in 445 ms of which 1 ms to minimize.
[2023-03-20 19:39:10] [INFO ] Deduced a trap composed of 12 places in 340 ms of which 0 ms to minimize.
[2023-03-20 19:39:11] [INFO ] Deduced a trap composed of 13 places in 429 ms of which 0 ms to minimize.
[2023-03-20 19:39:11] [INFO ] Deduced a trap composed of 12 places in 419 ms of which 1 ms to minimize.
[2023-03-20 19:39:12] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 0 ms to minimize.
[2023-03-20 19:39:12] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 1 ms to minimize.
[2023-03-20 19:39:13] [INFO ] Deduced a trap composed of 12 places in 444 ms of which 0 ms to minimize.
[2023-03-20 19:39:13] [INFO ] Deduced a trap composed of 12 places in 405 ms of which 1 ms to minimize.
[2023-03-20 19:39:14] [INFO ] Deduced a trap composed of 11 places in 420 ms of which 0 ms to minimize.
[2023-03-20 19:39:14] [INFO ] Deduced a trap composed of 11 places in 325 ms of which 2 ms to minimize.
[2023-03-20 19:39:14] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 4 ms to minimize.
[2023-03-20 19:39:15] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-20 19:39:15] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 1 ms to minimize.
[2023-03-20 19:39:15] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 10055 ms
[2023-03-20 19:39:15] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 0 ms to minimize.
[2023-03-20 19:39:16] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 0 ms to minimize.
[2023-03-20 19:39:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 646 ms
[2023-03-20 19:39:16] [INFO ] After 21636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 362 ms.
[2023-03-20 19:39:16] [INFO ] After 23726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 37 ms.
Support contains 5 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Graph (complete) has 487 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.37 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 124 transition count 2173
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 28 rules applied. Total rules applied 66 place count 112 transition count 2157
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 70 place count 108 transition count 2157
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 70 place count 108 transition count 2138
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 108 place count 89 transition count 2138
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 123 place count 74 transition count 2121
Iterating global reduction 3 with 15 rules applied. Total rules applied 138 place count 74 transition count 2121
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 150 place count 62 transition count 2109
Iterating global reduction 3 with 12 rules applied. Total rules applied 162 place count 62 transition count 2109
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 199 place count 62 transition count 2072
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 229 place count 47 transition count 2056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 47 transition count 2055
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 244 place count 33 transition count 2041
Iterating global reduction 5 with 14 rules applied. Total rules applied 258 place count 33 transition count 2041
Ensure Unique test removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Iterating post reduction 5 with 480 rules applied. Total rules applied 738 place count 33 transition count 1561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 740 place count 32 transition count 1560
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 741 place count 31 transition count 1559
Iterating global reduction 6 with 1 rules applied. Total rules applied 742 place count 31 transition count 1559
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 744 place count 31 transition count 1557
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 746 place count 31 transition count 1557
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 747 place count 30 transition count 1556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 748 place count 29 transition count 1556
Performed 10 Post agglomeration using F-continuation condition with reduction of 1513 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 774 place count 13 transition count 33
Drop transitions removed 10 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 793 place count 13 transition count 14
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 795 place count 13 transition count 14
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 797 place count 13 transition count 12
Applied a total of 797 rules in 2433 ms. Remains 13 /126 variables (removed 113) and now considering 12/2212 (removed 2200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2434 ms. Remains : 13/126 places, 12/2212 transitions.
Finished random walk after 14 steps, including 3 resets, run visited all 3 properties in 1 ms. (steps per millisecond=14 )
FORMULA StigmergyElection-PT-10a-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 22 stabilizing places and 21 stable transitions
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((G(p0)||(p0&&F(p1))))))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 118 transition count 2198
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 118 transition count 2198
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 114 transition count 2190
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 114 transition count 2190
Applied a total of 24 rules in 39 ms. Remains 114 /126 variables (removed 12) and now considering 2190/2212 (removed 22) transitions.
[2023-03-20 19:39:19] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
// Phase 1: matrix 2178 rows 114 cols
[2023-03-20 19:39:19] [INFO ] Computed 3 place invariants in 21 ms
[2023-03-20 19:39:20] [INFO ] Implicit Places using invariants in 801 ms returned []
[2023-03-20 19:39:20] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
[2023-03-20 19:39:20] [INFO ] Invariant cache hit.
[2023-03-20 19:39:21] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:39:21] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1953 ms to find 0 implicit places.
[2023-03-20 19:39:21] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
[2023-03-20 19:39:21] [INFO ] Invariant cache hit.
[2023-03-20 19:39:23] [INFO ] Dead Transitions using invariants and state equation in 1977 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/126 places, 2190/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3972 ms. Remains : 114/126 places, 2190/2212 transitions.
Stuttering acceptance computed with spot in 453 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (EQ s90 0) (EQ s62 1)), p0:(EQ s98 1)], 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, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-00 finished in 4530 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 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 117 transition count 2197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 117 transition count 2197
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 114 transition count 2191
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 114 transition count 2191
Applied a total of 24 rules in 32 ms. Remains 114 /126 variables (removed 12) and now considering 2191/2212 (removed 21) transitions.
[2023-03-20 19:39:24] [INFO ] Flow matrix only has 2180 transitions (discarded 11 similar events)
// Phase 1: matrix 2180 rows 114 cols
[2023-03-20 19:39:24] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-20 19:39:24] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-03-20 19:39:24] [INFO ] Flow matrix only has 2180 transitions (discarded 11 similar events)
[2023-03-20 19:39:24] [INFO ] Invariant cache hit.
[2023-03-20 19:39:25] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:39:25] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1767 ms to find 0 implicit places.
[2023-03-20 19:39:25] [INFO ] Flow matrix only has 2180 transitions (discarded 11 similar events)
[2023-03-20 19:39:25] [INFO ] Invariant cache hit.
[2023-03-20 19:39:27] [INFO ] Dead Transitions using invariants and state equation in 1523 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/126 places, 2191/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3325 ms. Remains : 114/126 places, 2191/2212 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s69 0) (EQ s55 1))], 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 50000 reset in 719 ms.
Product exploration explored 100000 steps with 50000 reset in 564 ms.
Computed a total of 22 stabilizing places and 21 stable transitions
Computed a total of 22 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-10a-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-10a-LTLCardinality-01 finished in 4880 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))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 118 transition count 2199
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 118 transition count 2199
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 114 transition count 2191
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 114 transition count 2191
Applied a total of 24 rules in 44 ms. Remains 114 /126 variables (removed 12) and now considering 2191/2212 (removed 21) transitions.
[2023-03-20 19:39:28] [INFO ] Flow matrix only has 2180 transitions (discarded 11 similar events)
// Phase 1: matrix 2180 rows 114 cols
[2023-03-20 19:39:29] [INFO ] Computed 2 place invariants in 25 ms
[2023-03-20 19:39:29] [INFO ] Implicit Places using invariants in 792 ms returned []
[2023-03-20 19:39:29] [INFO ] Flow matrix only has 2180 transitions (discarded 11 similar events)
[2023-03-20 19:39:29] [INFO ] Invariant cache hit.
[2023-03-20 19:39:30] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:39:30] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
[2023-03-20 19:39:30] [INFO ] Flow matrix only has 2180 transitions (discarded 11 similar events)
[2023-03-20 19:39:30] [INFO ] Invariant cache hit.
[2023-03-20 19:39:31] [INFO ] Dead Transitions using invariants and state equation in 1124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/126 places, 2191/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2982 ms. Remains : 114/126 places, 2191/2212 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s28 0) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-02 finished in 3213 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(X(X(F((F(p1)&&p0)))))))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 117 transition count 2197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 117 transition count 2197
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 113 transition count 2189
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 113 transition count 2189
Applied a total of 26 rules in 30 ms. Remains 113 /126 variables (removed 13) and now considering 2189/2212 (removed 23) transitions.
[2023-03-20 19:39:32] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2023-03-20 19:39:32] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-20 19:39:32] [INFO ] Implicit Places using invariants in 730 ms returned []
[2023-03-20 19:39:32] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-20 19:39:32] [INFO ] Invariant cache hit.
[2023-03-20 19:39:33] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:39:33] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
[2023-03-20 19:39:33] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-20 19:39:33] [INFO ] Invariant cache hit.
[2023-03-20 19:39:35] [INFO ] Dead Transitions using invariants and state equation in 1253 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/126 places, 2189/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3016 ms. Remains : 113/126 places, 2189/2212 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(AND (NEQ s29 0) (NEQ s12 1)), p0:(AND (NEQ s29 0) (NEQ s12 1))], 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, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-03 finished in 3326 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&&X(X(G(p1)))))))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 2202
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 2202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 118 transition count 2198
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 118 transition count 2198
Applied a total of 16 rules in 31 ms. Remains 118 /126 variables (removed 8) and now considering 2198/2212 (removed 14) transitions.
[2023-03-20 19:39:35] [INFO ] Flow matrix only has 2184 transitions (discarded 14 similar events)
// Phase 1: matrix 2184 rows 118 cols
[2023-03-20 19:39:35] [INFO ] Computed 3 place invariants in 10 ms
[2023-03-20 19:39:36] [INFO ] Implicit Places using invariants in 671 ms returned []
[2023-03-20 19:39:36] [INFO ] Flow matrix only has 2184 transitions (discarded 14 similar events)
[2023-03-20 19:39:36] [INFO ] Invariant cache hit.
[2023-03-20 19:39:37] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:39:37] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2023-03-20 19:39:37] [INFO ] Flow matrix only has 2184 transitions (discarded 14 similar events)
[2023-03-20 19:39:37] [INFO ] Invariant cache hit.
[2023-03-20 19:39:38] [INFO ] Dead Transitions using invariants and state equation in 1289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/126 places, 2198/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3157 ms. Remains : 118/126 places, 2198/2212 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s70 0) (EQ s46 1)), p1:(EQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-04 finished in 3426 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&&F(G(p1))))||G((p2 U X(p3))))))'
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 119 transition count 2200
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 119 transition count 2200
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 115 transition count 2192
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 115 transition count 2192
Applied a total of 22 rules in 29 ms. Remains 115 /126 variables (removed 11) and now considering 2192/2212 (removed 20) transitions.
[2023-03-20 19:39:38] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
// Phase 1: matrix 2180 rows 115 cols
[2023-03-20 19:39:38] [INFO ] Computed 3 place invariants in 12 ms
[2023-03-20 19:39:39] [INFO ] Implicit Places using invariants in 657 ms returned []
[2023-03-20 19:39:39] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-20 19:39:39] [INFO ] Invariant cache hit.
[2023-03-20 19:39:40] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:39:40] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
[2023-03-20 19:39:40] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-20 19:39:40] [INFO ] Invariant cache hit.
[2023-03-20 19:39:41] [INFO ] Dead Transitions using invariants and state equation in 1244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/126 places, 2192/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3011 ms. Remains : 115/126 places, 2192/2212 transitions.
Stuttering acceptance computed with spot in 547 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-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=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p3), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={0} source=7 dest: 7}], [{ cond=p1, acceptance={} source=8 dest: 8}, { cond=(NOT p1), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s114 0), p2:(OR (EQ s34 0) (EQ s83 1)), p1:(AND (EQ s45 0) (EQ s38 1)), p3:(OR (EQ s85 0) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25052 reset in 592 ms.
Product exploration explored 100000 steps with 24930 reset in 589 ms.
Computed a total of 22 stabilizing places and 21 stable transitions
Computed a total of 22 stabilizing places and 21 stable transitions
Detected a total of 22/115 stabilizing places and 21/2192 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), true, (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 16 factoid took 1617 ms. Reduced automaton from 10 states, 23 edges and 4 AP (stutter sensitive) to 10 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 861 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1405 ms. (steps per millisecond=7 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 19:39:47] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-20 19:39:47] [INFO ] Invariant cache hit.
[2023-03-20 19:39:47] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 19:39:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 19:39:48] [INFO ] After 776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 19:39:48] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:39:49] [INFO ] After 653ms SMT Verify possible using 2095 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 19:39:50] [INFO ] Deduced a trap composed of 12 places in 963 ms of which 1 ms to minimize.
[2023-03-20 19:39:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1027 ms
[2023-03-20 19:39:51] [INFO ] Deduced a trap composed of 11 places in 850 ms of which 0 ms to minimize.
[2023-03-20 19:39:52] [INFO ] Deduced a trap composed of 10 places in 706 ms of which 1 ms to minimize.
[2023-03-20 19:39:52] [INFO ] Deduced a trap composed of 10 places in 690 ms of which 1 ms to minimize.
[2023-03-20 19:39:53] [INFO ] Deduced a trap composed of 11 places in 727 ms of which 2 ms to minimize.
[2023-03-20 19:39:54] [INFO ] Deduced a trap composed of 12 places in 590 ms of which 1 ms to minimize.
[2023-03-20 19:39:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 3904 ms
[2023-03-20 19:39:54] [INFO ] After 5687ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :0
[2023-03-20 19:39:54] [INFO ] After 6645ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), true, (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p2 p1 (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (F (AND p2 (NOT p1) (NOT p3))), (F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p0) (NOT p3))), (F p1), (F (NOT p3)), (F (NOT p2)), (F (NOT p0)), (F (NOT (AND p2 (NOT p1)))), (F (AND p2 (NOT p0) (NOT p3)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 1716 ms. Reduced automaton from 10 states, 19 edges and 4 AP (stutter sensitive) to 10 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 445 ms :[false, false, (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p0)]
Stuttering acceptance computed with spot in 450 ms :[false, false, (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p0)]
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 2192/2192 transitions.
Applied a total of 0 rules in 10 ms. Remains 115 /115 variables (removed 0) and now considering 2192/2192 (removed 0) transitions.
[2023-03-20 19:39:57] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-20 19:39:57] [INFO ] Invariant cache hit.
[2023-03-20 19:39:57] [INFO ] Implicit Places using invariants in 656 ms returned []
[2023-03-20 19:39:57] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-20 19:39:57] [INFO ] Invariant cache hit.
[2023-03-20 19:39:58] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:39:58] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
[2023-03-20 19:39:58] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-20 19:39:58] [INFO ] Invariant cache hit.
[2023-03-20 19:40:00] [INFO ] Dead Transitions using invariants and state equation in 1357 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3063 ms. Remains : 115/115 places, 2192/2192 transitions.
Computed a total of 22 stabilizing places and 21 stable transitions
Computed a total of 22 stabilizing places and 21 stable transitions
Detected a total of 22/115 stabilizing places and 21/2192 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 p3 (NOT p1)), (X p3), (X (NOT (AND p0 p2 p3 (NOT p1)))), (X (X p3)), true, (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 p2 p3 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 9 factoid took 736 ms. Reduced automaton from 10 states, 19 edges and 4 AP (stutter sensitive) to 10 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 482 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1414 ms. (steps per millisecond=7 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 19:40:02] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-20 19:40:02] [INFO ] Invariant cache hit.
[2023-03-20 19:40:03] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 19:40:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 19:40:03] [INFO ] After 662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 19:40:03] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:40:04] [INFO ] After 513ms SMT Verify possible using 2095 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 19:40:05] [INFO ] Deduced a trap composed of 10 places in 967 ms of which 1 ms to minimize.
[2023-03-20 19:40:06] [INFO ] Deduced a trap composed of 11 places in 841 ms of which 3 ms to minimize.
[2023-03-20 19:40:07] [INFO ] Deduced a trap composed of 10 places in 683 ms of which 1 ms to minimize.
[2023-03-20 19:40:07] [INFO ] Deduced a trap composed of 12 places in 581 ms of which 1 ms to minimize.
[2023-03-20 19:40:08] [INFO ] Deduced a trap composed of 14 places in 686 ms of which 2 ms to minimize.
[2023-03-20 19:40:09] [INFO ] Deduced a trap composed of 11 places in 610 ms of which 2 ms to minimize.
[2023-03-20 19:40:09] [INFO ] Deduced a trap composed of 13 places in 497 ms of which 1 ms to minimize.
[2023-03-20 19:40:10] [INFO ] Deduced a trap composed of 13 places in 420 ms of which 1 ms to minimize.
[2023-03-20 19:40:10] [INFO ] Deduced a trap composed of 13 places in 439 ms of which 0 ms to minimize.
[2023-03-20 19:40:11] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 1 ms to minimize.
[2023-03-20 19:40:11] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 1 ms to minimize.
[2023-03-20 19:40:11] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 1 ms to minimize.
[2023-03-20 19:40:12] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 0 ms to minimize.
[2023-03-20 19:40:12] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2023-03-20 19:40:12] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 8040 ms
[2023-03-20 19:40:12] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 1 ms to minimize.
[2023-03-20 19:40:13] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2023-03-20 19:40:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 580 ms
[2023-03-20 19:40:13] [INFO ] After 9258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 158 ms.
[2023-03-20 19:40:13] [INFO ] After 10256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 2192/2192 transitions.
Graph (complete) has 473 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 114 transition count 2161
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 49 place count 105 transition count 2152
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 49 place count 105 transition count 2132
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 89 place count 85 transition count 2132
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 99 place count 75 transition count 2121
Iterating global reduction 2 with 10 rules applied. Total rules applied 109 place count 75 transition count 2121
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 118 place count 66 transition count 2112
Iterating global reduction 2 with 9 rules applied. Total rules applied 127 place count 66 transition count 2112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 136 place count 66 transition count 2103
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 176 place count 46 transition count 2082
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 196 place count 26 transition count 2062
Iterating global reduction 3 with 20 rules applied. Total rules applied 216 place count 26 transition count 2062
Ensure Unique test removed 1022 transitions
Reduce isomorphic transitions removed 1022 transitions.
Iterating post reduction 3 with 1022 rules applied. Total rules applied 1238 place count 26 transition count 1040
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1239 place count 26 transition count 1039
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1240 place count 26 transition count 1039
Applied a total of 1240 rules in 863 ms. Remains 26 /115 variables (removed 89) and now considering 1039/2192 (removed 1153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 863 ms. Remains : 26/115 places, 1039/2192 transitions.
Finished random walk after 8548 steps, including 2 resets, run visited all 2 properties in 1273 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 p2 p3 (NOT p1)), (X p3), (X (NOT (AND p0 p2 p3 (NOT p1)))), (X (X p3)), true, (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 p2 p3 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 p3)), (F (AND (NOT p0) (NOT p3))), (F (OR p1 (NOT p0) (NOT p2))), (F (NOT p3)), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p3))))]
Knowledge based reduction with 9 factoid took 909 ms. Reduced automaton from 10 states, 16 edges and 4 AP (stutter sensitive) to 10 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 473 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 464 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 461 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 424 ms.
Product exploration explored 100000 steps with 0 reset in 963 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 474 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0)]
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 2192/2192 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 115 transition count 2193
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 115 transition count 2193
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 0 with 28 rules applied. Total rules applied 37 place count 115 transition count 2203
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 55 place count 97 transition count 2184
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 73 place count 97 transition count 2184
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 328 place count 97 transition count 1929
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 337 place count 97 transition count 1948
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 346 place count 88 transition count 1930
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 355 place count 88 transition count 1930
Deduced a syphon composed of 36 places in 1 ms
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 377 place count 88 transition count 1908
Deduced a syphon composed of 36 places in 1 ms
Applied a total of 377 rules in 2278 ms. Remains 88 /115 variables (removed 27) and now considering 1908/2192 (removed 284) transitions.
[2023-03-20 19:40:22] [INFO ] Redundant transitions in 382 ms returned []
[2023-03-20 19:40:22] [INFO ] Flow matrix only has 1896 transitions (discarded 12 similar events)
// Phase 1: matrix 1896 rows 88 cols
[2023-03-20 19:40:22] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-20 19:40:23] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/115 places, 1908/2192 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3856 ms. Remains : 88/115 places, 1908/2192 transitions.
Support contains 7 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 2192/2192 transitions.
Applied a total of 0 rules in 9 ms. Remains 115 /115 variables (removed 0) and now considering 2192/2192 (removed 0) transitions.
[2023-03-20 19:40:23] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
// Phase 1: matrix 2180 rows 115 cols
[2023-03-20 19:40:23] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-20 19:40:24] [INFO ] Implicit Places using invariants in 669 ms returned []
[2023-03-20 19:40:24] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-20 19:40:24] [INFO ] Invariant cache hit.
[2023-03-20 19:40:25] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:40:25] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1743 ms to find 0 implicit places.
[2023-03-20 19:40:25] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
[2023-03-20 19:40:25] [INFO ] Invariant cache hit.
[2023-03-20 19:40:27] [INFO ] Dead Transitions using invariants and state equation in 1860 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3621 ms. Remains : 115/115 places, 2192/2192 transitions.
Treatment of property StigmergyElection-PT-10a-LTLCardinality-07 finished in 49314 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(F(p0)))'
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 124 transition count 2172
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 85 transition count 2172
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 79 place count 85 transition count 2161
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 101 place count 74 transition count 2161
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 114 place count 61 transition count 2142
Iterating global reduction 2 with 13 rules applied. Total rules applied 127 place count 61 transition count 2142
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 158 place count 61 transition count 2111
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 158 place count 61 transition count 2107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 166 place count 57 transition count 2107
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 170 place count 53 transition count 2099
Iterating global reduction 3 with 4 rules applied. Total rules applied 174 place count 53 transition count 2099
Ensure Unique test removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Iterating post reduction 3 with 480 rules applied. Total rules applied 654 place count 53 transition count 1619
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 674 place count 43 transition count 1609
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 684 place count 43 transition count 1599
Drop transitions removed 1498 transitions
Redundant transition composition rules discarded 1498 transitions
Iterating global reduction 5 with 1498 rules applied. Total rules applied 2182 place count 43 transition count 101
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 2202 place count 33 transition count 91
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 2212 place count 23 transition count 81
Applied a total of 2212 rules in 454 ms. Remains 23 /126 variables (removed 103) and now considering 81/2212 (removed 2131) transitions.
[2023-03-20 19:40:28] [INFO ] Flow matrix only has 71 transitions (discarded 10 similar events)
// Phase 1: matrix 71 rows 23 cols
[2023-03-20 19:40:28] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 19:40:28] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-20 19:40:28] [INFO ] Flow matrix only has 71 transitions (discarded 10 similar events)
[2023-03-20 19:40:28] [INFO ] Invariant cache hit.
[2023-03-20 19:40:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 19:40:29] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-20 19:40:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 19:40:29] [INFO ] Flow matrix only has 71 transitions (discarded 10 similar events)
[2023-03-20 19:40:29] [INFO ] Invariant cache hit.
[2023-03-20 19:40:29] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/126 places, 81/2212 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 892 ms. Remains : 23/126 places, 81/2212 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-10 finished in 1007 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(X((F(p0)&&F(G(p1)))))))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 119 transition count 2201
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 119 transition count 2201
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 116 transition count 2195
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 116 transition count 2195
Applied a total of 20 rules in 28 ms. Remains 116 /126 variables (removed 10) and now considering 2195/2212 (removed 17) transitions.
[2023-03-20 19:40:29] [INFO ] Flow matrix only has 2183 transitions (discarded 12 similar events)
// Phase 1: matrix 2183 rows 116 cols
[2023-03-20 19:40:29] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-20 19:40:29] [INFO ] Implicit Places using invariants in 675 ms returned []
[2023-03-20 19:40:29] [INFO ] Flow matrix only has 2183 transitions (discarded 12 similar events)
[2023-03-20 19:40:29] [INFO ] Invariant cache hit.
[2023-03-20 19:40:30] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:40:30] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1691 ms to find 0 implicit places.
[2023-03-20 19:40:30] [INFO ] Flow matrix only has 2183 transitions (discarded 12 similar events)
[2023-03-20 19:40:30] [INFO ] Invariant cache hit.
[2023-03-20 19:40:32] [INFO ] Dead Transitions using invariants and state equation in 1355 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/126 places, 2195/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3077 ms. Remains : 116/126 places, 2195/2212 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s72 1)), p1:(OR (EQ s85 0) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 18 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-11 finished in 3376 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(G(p0)))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 117 transition count 2197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 117 transition count 2197
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 113 transition count 2189
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 113 transition count 2189
Applied a total of 26 rules in 28 ms. Remains 113 /126 variables (removed 13) and now considering 2189/2212 (removed 23) transitions.
[2023-03-20 19:40:32] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2023-03-20 19:40:32] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-20 19:40:33] [INFO ] Implicit Places using invariants in 737 ms returned []
[2023-03-20 19:40:33] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-20 19:40:33] [INFO ] Invariant cache hit.
[2023-03-20 19:40:34] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:40:34] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1722 ms to find 0 implicit places.
[2023-03-20 19:40:34] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-20 19:40:34] [INFO ] Invariant cache hit.
[2023-03-20 19:40:35] [INFO ] Dead Transitions using invariants and state equation in 1392 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/126 places, 2189/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3143 ms. Remains : 113/126 places, 2189/2212 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s42 0) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 418 ms.
Product exploration explored 100000 steps with 0 reset in 757 ms.
Computed a total of 22 stabilizing places and 21 stable transitions
Computed a total of 22 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1209 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Finished Best-First random walk after 2213 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=553 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 9 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
[2023-03-20 19:40:38] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-20 19:40:38] [INFO ] Invariant cache hit.
[2023-03-20 19:40:39] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2023-03-20 19:40:39] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-20 19:40:39] [INFO ] Invariant cache hit.
[2023-03-20 19:40:40] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:40:40] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 2039 ms to find 0 implicit places.
[2023-03-20 19:40:40] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-20 19:40:40] [INFO ] Invariant cache hit.
[2023-03-20 19:40:42] [INFO ] Dead Transitions using invariants and state equation in 1322 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3394 ms. Remains : 113/113 places, 2189/2189 transitions.
Computed a total of 22 stabilizing places and 21 stable transitions
Computed a total of 22 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 260 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 3809 steps, including 1 resets, run visited all 1 properties in 465 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2823 ms.
Entered a terminal (fully accepting) state of product in 22813 steps with 0 reset in 2460 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-12 finished in 16505 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(p0)))'
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 117 transition count 2197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 117 transition count 2197
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 113 transition count 2189
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 113 transition count 2189
Applied a total of 26 rules in 28 ms. Remains 113 /126 variables (removed 13) and now considering 2189/2212 (removed 23) transitions.
[2023-03-20 19:40:49] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-20 19:40:49] [INFO ] Invariant cache hit.
[2023-03-20 19:40:50] [INFO ] Implicit Places using invariants in 916 ms returned []
[2023-03-20 19:40:50] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-20 19:40:50] [INFO ] Invariant cache hit.
[2023-03-20 19:40:50] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:40:51] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1929 ms to find 0 implicit places.
[2023-03-20 19:40:51] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-20 19:40:51] [INFO ] Invariant cache hit.
[2023-03-20 19:40:52] [INFO ] Dead Transitions using invariants and state equation in 1164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/126 places, 2189/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3134 ms. Remains : 113/126 places, 2189/2212 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(EQ s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-13 finished in 3283 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(X(F(p0)))))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 118 transition count 2199
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 118 transition count 2199
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 115 transition count 2193
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 115 transition count 2193
Applied a total of 22 rules in 26 ms. Remains 115 /126 variables (removed 11) and now considering 2193/2212 (removed 19) transitions.
[2023-03-20 19:40:52] [INFO ] Flow matrix only has 2181 transitions (discarded 12 similar events)
// Phase 1: matrix 2181 rows 115 cols
[2023-03-20 19:40:52] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-20 19:40:53] [INFO ] Implicit Places using invariants in 659 ms returned []
[2023-03-20 19:40:53] [INFO ] Flow matrix only has 2181 transitions (discarded 12 similar events)
[2023-03-20 19:40:53] [INFO ] Invariant cache hit.
[2023-03-20 19:40:53] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:40:54] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1704 ms to find 0 implicit places.
[2023-03-20 19:40:54] [INFO ] Flow matrix only has 2181 transitions (discarded 12 similar events)
[2023-03-20 19:40:54] [INFO ] Invariant cache hit.
[2023-03-20 19:40:55] [INFO ] Dead Transitions using invariants and state equation in 1341 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/126 places, 2193/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3095 ms. Remains : 115/126 places, 2193/2212 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s31 0) (EQ s28 1))], 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, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-14 finished in 3273 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(p0)))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 2212/2212 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 117 transition count 2197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 117 transition count 2197
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 113 transition count 2189
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 113 transition count 2189
Applied a total of 26 rules in 26 ms. Remains 113 /126 variables (removed 13) and now considering 2189/2212 (removed 23) transitions.
[2023-03-20 19:40:55] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2023-03-20 19:40:55] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-20 19:40:56] [INFO ] Implicit Places using invariants in 636 ms returned []
[2023-03-20 19:40:56] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-20 19:40:56] [INFO ] Invariant cache hit.
[2023-03-20 19:40:57] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-20 19:40:57] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
[2023-03-20 19:40:57] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2023-03-20 19:40:57] [INFO ] Invariant cache hit.
[2023-03-20 19:40:58] [INFO ] Dead Transitions using invariants and state equation in 1277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/126 places, 2189/2212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3053 ms. Remains : 113/126 places, 2189/2212 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s103 0) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 444 ms.
Product exploration explored 100000 steps with 33333 reset in 449 ms.
Computed a total of 22 stabilizing places and 21 stable transitions
Computed a total of 22 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-10a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-10a-LTLCardinality-15 finished in 4225 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&&F(G(p1))))||G((p2 U X(p3))))))'
[2023-03-20 19:41:00] [INFO ] Flatten gal took : 246 ms
[2023-03-20 19:41:00] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-20 19:41:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 2212 transitions and 41540 arcs took 118 ms.
Total runtime 141084 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT StigmergyElection-PT-10a
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA StigmergyElection-PT-10a-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679341360376

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 StigmergyElection-PT-10a-LTLCardinality-07
lola: time limit : 3599 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
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3599 2/32 StigmergyElection-PT-10a-LTLCardinality-07 179043 m, 35808 m/sec, 1534726 t fired, .

Time elapsed: 6 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3599 3/32 StigmergyElection-PT-10a-LTLCardinality-07 373092 m, 38809 m/sec, 3568662 t fired, .

Time elapsed: 11 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3599 5/32 StigmergyElection-PT-10a-LTLCardinality-07 648662 m, 55114 m/sec, 6086545 t fired, .

Time elapsed: 16 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3599 6/32 StigmergyElection-PT-10a-LTLCardinality-07 873179 m, 44903 m/sec, 8362820 t fired, .

Time elapsed: 21 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3599 8/32 StigmergyElection-PT-10a-LTLCardinality-07 1058944 m, 37153 m/sec, 10268143 t fired, .

Time elapsed: 26 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3599 9/32 StigmergyElection-PT-10a-LTLCardinality-07 1255068 m, 39224 m/sec, 12220044 t fired, .

Time elapsed: 31 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3599 10/32 StigmergyElection-PT-10a-LTLCardinality-07 1452190 m, 39424 m/sec, 14262168 t fired, .

Time elapsed: 36 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3599 12/32 StigmergyElection-PT-10a-LTLCardinality-07 1640644 m, 37690 m/sec, 16287445 t fired, .

Time elapsed: 41 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3599 13/32 StigmergyElection-PT-10a-LTLCardinality-07 1832364 m, 38344 m/sec, 18432447 t fired, .

Time elapsed: 46 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3599 14/32 StigmergyElection-PT-10a-LTLCardinality-07 2008496 m, 35226 m/sec, 20626708 t fired, .

Time elapsed: 51 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3599 15/32 StigmergyElection-PT-10a-LTLCardinality-07 2188569 m, 36014 m/sec, 22820368 t fired, .

Time elapsed: 56 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3599 17/32 StigmergyElection-PT-10a-LTLCardinality-07 2363918 m, 35069 m/sec, 24922884 t fired, .

Time elapsed: 61 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3599 18/32 StigmergyElection-PT-10a-LTLCardinality-07 2566602 m, 40536 m/sec, 27197727 t fired, .

Time elapsed: 66 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3599 19/32 StigmergyElection-PT-10a-LTLCardinality-07 2753886 m, 37456 m/sec, 29165467 t fired, .

Time elapsed: 71 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3599 20/32 StigmergyElection-PT-10a-LTLCardinality-07 2937683 m, 36759 m/sec, 31095631 t fired, .

Time elapsed: 76 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3599 22/32 StigmergyElection-PT-10a-LTLCardinality-07 3128959 m, 38255 m/sec, 33162772 t fired, .

Time elapsed: 81 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3599 23/32 StigmergyElection-PT-10a-LTLCardinality-07 3297150 m, 33638 m/sec, 35311241 t fired, .

Time elapsed: 86 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3599 24/32 StigmergyElection-PT-10a-LTLCardinality-07 3468544 m, 34278 m/sec, 37395051 t fired, .

Time elapsed: 91 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-10a-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3599 25/32 StigmergyElection-PT-10a-LTLCardinality-07 3633990 m, 33089 m/sec, 39396573 t fired, .

Time elapsed: 96 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
lola: FINISHED task # 1 (type EXCL) for StigmergyElection-PT-10a-LTLCardinality-07
lola: result : false
lola: markings : 3765689
lola: fired transitions : 40987983
lola: time used : 98.000000
lola: memory pages used : 26
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
StigmergyElection-PT-10a-LTLCardinality-07: LTL false LTL model checker


Time elapsed: 99 secs. Pages in use: 26

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="StigmergyElection-PT-10a"
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 StigmergyElection-PT-10a, 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 r455-smll-167912647700683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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