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.r457-smll-167912649500612.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 ltsminxred
Input is StigmergyElection-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649500612
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 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 428K 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-05b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679543587260

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 03:53:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 03:53:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 03:53:10] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2023-03-23 03:53:10] [INFO ] Transformed 699 places.
[2023-03-23 03:53:10] [INFO ] Transformed 1266 transitions.
[2023-03-23 03:53:10] [INFO ] Found NUPN structural information;
[2023-03-23 03:53:10] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 328 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyElection-PT-05b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 699 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 88 place count 611 transition count 1178
Iterating global reduction 0 with 88 rules applied. Total rules applied 176 place count 611 transition count 1178
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 223 place count 564 transition count 1131
Iterating global reduction 0 with 47 rules applied. Total rules applied 270 place count 564 transition count 1131
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 280 place count 554 transition count 1121
Iterating global reduction 0 with 10 rules applied. Total rules applied 290 place count 554 transition count 1121
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 295 place count 549 transition count 1116
Iterating global reduction 0 with 5 rules applied. Total rules applied 300 place count 549 transition count 1116
Applied a total of 300 rules in 255 ms. Remains 549 /699 variables (removed 150) and now considering 1116/1266 (removed 150) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2023-03-23 03:53:11] [INFO ] Computed 6 place invariants in 43 ms
[2023-03-23 03:53:11] [INFO ] Implicit Places using invariants in 695 ms returned []
[2023-03-23 03:53:11] [INFO ] Invariant cache hit.
[2023-03-23 03:53:12] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
[2023-03-23 03:53:12] [INFO ] Invariant cache hit.
[2023-03-23 03:53:13] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/699 places, 1116/1266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2928 ms. Remains : 549/699 places, 1116/1266 transitions.
Support contains 44 out of 549 places after structural reductions.
[2023-03-23 03:53:14] [INFO ] Flatten gal took : 265 ms
[2023-03-23 03:53:14] [INFO ] Flatten gal took : 112 ms
[2023-03-23 03:53:14] [INFO ] Input system was already deterministic with 1116 transitions.
Incomplete random walk after 10000 steps, including 111 resets, run finished after 840 ms. (steps per millisecond=11 ) properties (out of 28) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-23 03:53:16] [INFO ] Invariant cache hit.
[2023-03-23 03:53:16] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-23 03:53:17] [INFO ] After 483ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:19
[2023-03-23 03:53:17] [INFO ] Deduced a trap composed of 165 places in 424 ms of which 12 ms to minimize.
[2023-03-23 03:53:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 564 ms
[2023-03-23 03:53:17] [INFO ] After 1102ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-23 03:53:17] [INFO ] After 1622ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-23 03:53:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 65 ms returned sat
[2023-03-23 03:53:20] [INFO ] After 1608ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :19
[2023-03-23 03:53:20] [INFO ] Deduced a trap composed of 165 places in 341 ms of which 1 ms to minimize.
[2023-03-23 03:53:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 419 ms
[2023-03-23 03:53:22] [INFO ] After 3807ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :19
Attempting to minimize the solution found.
Minimization took 1183 ms.
[2023-03-23 03:53:23] [INFO ] After 5914ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :19
Fused 20 Parikh solutions to 17 different solutions.
Parikh walk visited 16 properties in 237 ms.
Support contains 3 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 555 edges and 549 vertex of which 78 / 549 are part of one of the 14 SCC in 14 ms
Free SCC test removed 64 places
Drop transitions removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Graph (complete) has 1049 edges and 485 vertex of which 480 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.17 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 342 rules applied. Total rules applied 344 place count 480 transition count 687
Reduce places removed 337 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 349 rules applied. Total rules applied 693 place count 143 transition count 675
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 701 place count 137 transition count 673
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 703 place count 135 transition count 673
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 703 place count 135 transition count 647
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 755 place count 109 transition count 647
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 756 place count 109 transition count 646
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 8 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 808 place count 83 transition count 620
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 817 place count 83 transition count 611
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 837 place count 63 transition count 170
Iterating global reduction 6 with 20 rules applied. Total rules applied 857 place count 63 transition count 170
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 868 place count 63 transition count 159
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 872 place count 59 transition count 155
Iterating global reduction 7 with 4 rules applied. Total rules applied 876 place count 59 transition count 155
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 886 place count 54 transition count 150
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 892 place count 51 transition count 158
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 900 place count 51 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 902 place count 50 transition count 156
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 910 place count 50 transition count 148
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 936 place count 50 transition count 122
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 43 rules applied. Total rules applied 979 place count 24 transition count 105
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 984 place count 19 transition count 100
Iterating global reduction 8 with 5 rules applied. Total rules applied 989 place count 19 transition count 100
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1004 place count 19 transition count 85
Applied a total of 1004 rules in 314 ms. Remains 19 /549 variables (removed 530) and now considering 85/1116 (removed 1031) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 19/549 places, 85/1116 transitions.
Finished random walk after 24 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=12 )
FORMULA StigmergyElection-PT-05b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA StigmergyElection-PT-05b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA StigmergyElection-PT-05b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 75 stabilizing places and 80 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' '!(G(F((p0&&X(p1)))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 21 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-23 03:53:25] [INFO ] Invariant cache hit.
[2023-03-23 03:53:25] [INFO ] Implicit Places using invariants in 759 ms returned []
[2023-03-23 03:53:25] [INFO ] Invariant cache hit.
[2023-03-23 03:53:26] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1556 ms to find 0 implicit places.
[2023-03-23 03:53:26] [INFO ] Invariant cache hit.
[2023-03-23 03:53:27] [INFO ] Dead Transitions using invariants and state equation in 940 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2530 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 618 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s486 1), p1:(NEQ s335 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33371 reset in 561 ms.
Product exploration explored 100000 steps with 33439 reset in 547 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 533 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 111 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 03:53:30] [INFO ] Invariant cache hit.
[2023-03-23 03:53:30] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-23 03:53:31] [INFO ] After 463ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-23 03:53:31] [INFO ] Deduced a trap composed of 164 places in 472 ms of which 2 ms to minimize.
[2023-03-23 03:53:32] [INFO ] Deduced a trap composed of 165 places in 501 ms of which 1 ms to minimize.
[2023-03-23 03:53:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1119 ms
[2023-03-23 03:53:32] [INFO ] After 1616ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 03:53:32] [INFO ] After 1782ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 03:53:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-23 03:53:33] [INFO ] After 575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 03:53:33] [INFO ] Deduced a trap composed of 164 places in 437 ms of which 1 ms to minimize.
[2023-03-23 03:53:34] [INFO ] Deduced a trap composed of 165 places in 403 ms of which 1 ms to minimize.
[2023-03-23 03:53:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 976 ms
[2023-03-23 03:53:34] [INFO ] After 1647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-23 03:53:34] [INFO ] After 1900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 558 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Drop transitions removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1041 edges and 479 vertex of which 474 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 339 rules applied. Total rules applied 341 place count 474 transition count 682
Reduce places removed 334 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 344 rules applied. Total rules applied 685 place count 140 transition count 672
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 692 place count 135 transition count 670
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 694 place count 133 transition count 670
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 694 place count 133 transition count 644
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 746 place count 107 transition count 644
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 747 place count 107 transition count 643
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 799 place count 81 transition count 617
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 809 place count 81 transition count 607
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 829 place count 61 transition count 166
Iterating global reduction 6 with 20 rules applied. Total rules applied 849 place count 61 transition count 166
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 860 place count 61 transition count 155
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 864 place count 57 transition count 151
Iterating global reduction 7 with 4 rules applied. Total rules applied 868 place count 57 transition count 151
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 878 place count 52 transition count 146
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 884 place count 49 transition count 154
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 892 place count 49 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 894 place count 48 transition count 152
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 902 place count 48 transition count 144
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 928 place count 48 transition count 118
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 963 place count 22 transition count 109
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 968 place count 17 transition count 104
Iterating global reduction 8 with 5 rules applied. Total rules applied 973 place count 17 transition count 104
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 996 place count 17 transition count 81
Applied a total of 996 rules in 162 ms. Remains 17 /549 variables (removed 532) and now considering 81/1116 (removed 1035) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 17/549 places, 81/1116 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 476 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 27 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-23 03:53:35] [INFO ] Invariant cache hit.
[2023-03-23 03:53:35] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-23 03:53:35] [INFO ] Invariant cache hit.
[2023-03-23 03:53:36] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1047 ms to find 0 implicit places.
[2023-03-23 03:53:36] [INFO ] Invariant cache hit.
[2023-03-23 03:53:37] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1902 ms. Remains : 549/549 places, 1116/1116 transitions.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 434 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 112 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 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 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 03:53:37] [INFO ] Invariant cache hit.
[2023-03-23 03:53:38] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-23 03:53:38] [INFO ] After 462ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-23 03:53:39] [INFO ] Deduced a trap composed of 165 places in 436 ms of which 1 ms to minimize.
[2023-03-23 03:53:39] [INFO ] Deduced a trap composed of 164 places in 404 ms of which 1 ms to minimize.
[2023-03-23 03:53:39] [INFO ] Deduced a trap composed of 163 places in 373 ms of which 1 ms to minimize.
[2023-03-23 03:53:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1414 ms
[2023-03-23 03:53:40] [INFO ] After 1916ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 03:53:40] [INFO ] After 2148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 03:53:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-23 03:53:40] [INFO ] After 525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 03:53:41] [INFO ] Deduced a trap composed of 164 places in 434 ms of which 1 ms to minimize.
[2023-03-23 03:53:41] [INFO ] Deduced a trap composed of 165 places in 411 ms of which 2 ms to minimize.
[2023-03-23 03:53:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 964 ms
[2023-03-23 03:53:41] [INFO ] After 1610ms 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-23 03:53:41] [INFO ] After 1922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 558 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 2 ms
Free SCC test removed 70 places
Drop transitions removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1041 edges and 479 vertex of which 474 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 339 rules applied. Total rules applied 341 place count 474 transition count 682
Reduce places removed 334 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 344 rules applied. Total rules applied 685 place count 140 transition count 672
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 692 place count 135 transition count 670
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 694 place count 133 transition count 670
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 694 place count 133 transition count 644
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 746 place count 107 transition count 644
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 747 place count 107 transition count 643
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 799 place count 81 transition count 617
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 809 place count 81 transition count 607
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 829 place count 61 transition count 166
Iterating global reduction 6 with 20 rules applied. Total rules applied 849 place count 61 transition count 166
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 860 place count 61 transition count 155
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 864 place count 57 transition count 151
Iterating global reduction 7 with 4 rules applied. Total rules applied 868 place count 57 transition count 151
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 878 place count 52 transition count 146
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 884 place count 49 transition count 154
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 892 place count 49 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 894 place count 48 transition count 152
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 902 place count 48 transition count 144
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 928 place count 48 transition count 118
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 963 place count 22 transition count 109
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 968 place count 17 transition count 104
Iterating global reduction 8 with 5 rules applied. Total rules applied 973 place count 17 transition count 104
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 996 place count 17 transition count 81
Applied a total of 996 rules in 148 ms. Remains 17 /549 variables (removed 532) and now considering 81/1116 (removed 1035) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 17/549 places, 81/1116 transitions.
Finished random walk after 114 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 709 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33273 reset in 364 ms.
Product exploration explored 100000 steps with 33350 reset in 382 ms.
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 11 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-23 03:53:44] [INFO ] Invariant cache hit.
[2023-03-23 03:53:44] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-23 03:53:44] [INFO ] Invariant cache hit.
[2023-03-23 03:53:45] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
[2023-03-23 03:53:45] [INFO ] Invariant cache hit.
[2023-03-23 03:53:46] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2072 ms. Remains : 549/549 places, 1116/1116 transitions.
Treatment of property StigmergyElection-PT-05b-LTLFireability-00 finished in 21477 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)&&F(G(p1)))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 555 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 324 transitions
Trivial Post-agglo rules discarded 324 transitions
Performed 324 trivial Post agglomeration. Transition count delta: 324
Iterating post reduction 0 with 324 rules applied. Total rules applied 325 place count 478 transition count 711
Reduce places removed 324 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 334 rules applied. Total rules applied 659 place count 154 transition count 701
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 664 place count 149 transition count 701
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 664 place count 149 transition count 681
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 704 place count 129 transition count 681
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 708 place count 125 transition count 677
Iterating global reduction 3 with 4 rules applied. Total rules applied 712 place count 125 transition count 677
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 760 place count 101 transition count 653
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 777 place count 84 transition count 292
Iterating global reduction 3 with 17 rules applied. Total rules applied 794 place count 84 transition count 292
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 801 place count 84 transition count 285
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 805 place count 80 transition count 277
Iterating global reduction 4 with 4 rules applied. Total rules applied 809 place count 80 transition count 277
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 813 place count 76 transition count 269
Iterating global reduction 4 with 4 rules applied. Total rules applied 817 place count 76 transition count 269
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 835 place count 67 transition count 276
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 836 place count 66 transition count 265
Iterating global reduction 4 with 1 rules applied. Total rules applied 837 place count 66 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 838 place count 66 transition count 264
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 844 place count 66 transition count 258
Applied a total of 844 rules in 175 ms. Remains 66 /549 variables (removed 483) and now considering 258/1116 (removed 858) transitions.
[2023-03-23 03:53:46] [INFO ] Flow matrix only has 252 transitions (discarded 6 similar events)
// Phase 1: matrix 252 rows 66 cols
[2023-03-23 03:53:46] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-23 03:53:47] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-23 03:53:47] [INFO ] Flow matrix only has 252 transitions (discarded 6 similar events)
[2023-03-23 03:53:47] [INFO ] Invariant cache hit.
[2023-03-23 03:53:47] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-23 03:53:47] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2023-03-23 03:53:47] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-23 03:53:47] [INFO ] Flow matrix only has 252 transitions (discarded 6 similar events)
[2023-03-23 03:53:47] [INFO ] Invariant cache hit.
[2023-03-23 03:53:47] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/549 places, 258/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 926 ms. Remains : 66/549 places, 258/1116 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s19 0) (EQ s32 0) (EQ s45 0) (EQ s58 0)), p1:(EQ s42 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10717 steps with 1147 reset in 60 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-02 finished in 1118 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)&&F((G(p1)||G(p0))))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 559 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 324 place count 478 transition count 712
Reduce places removed 323 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 333 rules applied. Total rules applied 657 place count 155 transition count 702
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 664 place count 150 transition count 700
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 666 place count 148 transition count 700
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 666 place count 148 transition count 679
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 708 place count 127 transition count 679
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 712 place count 123 transition count 675
Iterating global reduction 4 with 4 rules applied. Total rules applied 716 place count 123 transition count 675
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 764 place count 99 transition count 651
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 784 place count 79 transition count 214
Iterating global reduction 4 with 20 rules applied. Total rules applied 804 place count 79 transition count 214
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 813 place count 79 transition count 205
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 818 place count 74 transition count 195
Iterating global reduction 5 with 5 rules applied. Total rules applied 823 place count 74 transition count 195
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 828 place count 69 transition count 185
Iterating global reduction 5 with 5 rules applied. Total rules applied 833 place count 69 transition count 185
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 851 place count 60 transition count 192
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 852 place count 59 transition count 182
Iterating global reduction 5 with 1 rules applied. Total rules applied 853 place count 59 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 854 place count 59 transition count 181
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 859 place count 59 transition count 176
Applied a total of 859 rules in 161 ms. Remains 59 /549 variables (removed 490) and now considering 176/1116 (removed 940) transitions.
[2023-03-23 03:53:47] [INFO ] Flow matrix only has 170 transitions (discarded 6 similar events)
// Phase 1: matrix 170 rows 59 cols
[2023-03-23 03:53:47] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 03:53:48] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-23 03:53:48] [INFO ] Flow matrix only has 170 transitions (discarded 6 similar events)
[2023-03-23 03:53:48] [INFO ] Invariant cache hit.
[2023-03-23 03:53:48] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-23 03:53:48] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
[2023-03-23 03:53:48] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-23 03:53:48] [INFO ] Flow matrix only has 170 transitions (discarded 6 similar events)
[2023-03-23 03:53:48] [INFO ] Invariant cache hit.
[2023-03-23 03:53:48] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/549 places, 176/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1042 ms. Remains : 59/549 places, 176/1116 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s41 1), p1:(NEQ s10 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 16506 steps with 1826 reset in 49 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-05 finished in 1404 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 U (G(p0)||(F(G(p2))&&p1))))))'
Support contains 9 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 13 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2023-03-23 03:53:49] [INFO ] Computed 6 place invariants in 14 ms
[2023-03-23 03:53:49] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-03-23 03:53:49] [INFO ] Invariant cache hit.
[2023-03-23 03:53:50] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 1263 ms to find 0 implicit places.
[2023-03-23 03:53:50] [INFO ] Invariant cache hit.
[2023-03-23 03:53:51] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2067 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s69 1) (EQ s175 1) (EQ s270 1) (EQ s376 1) (EQ s482 1))) (EQ s69 1) (EQ s164 1) (EQ s292 1) (EQ s387 1) (EQ s482 1)), p0:(AND (EQ s6...], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-06 finished in 2306 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)||G(p1))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 12 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-23 03:53:51] [INFO ] Invariant cache hit.
[2023-03-23 03:53:51] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-23 03:53:51] [INFO ] Invariant cache hit.
[2023-03-23 03:53:52] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
[2023-03-23 03:53:52] [INFO ] Invariant cache hit.
[2023-03-23 03:53:53] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1785 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s22 1) (EQ s150 1) (EQ s245 1) (EQ s340 1) (EQ s468 1)), p1:(EQ s521 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][false, false, false]]
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-07 finished in 1924 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&&G(F(p1))))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 11 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-23 03:53:53] [INFO ] Invariant cache hit.
[2023-03-23 03:53:53] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-23 03:53:53] [INFO ] Invariant cache hit.
[2023-03-23 03:53:54] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
[2023-03-23 03:53:54] [INFO ] Invariant cache hit.
[2023-03-23 03:53:55] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1785 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s542 0), p1:(OR (NEQ s33 1) (NEQ s150 1) (NEQ s234 1) (NEQ s340 1) (NEQ s468 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1123 reset in 206 ms.
Product exploration explored 100000 steps with 1116 reset in 255 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 113 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 724612 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 724612 steps, saw 123572 distinct states, run finished after 3003 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 03:53:59] [INFO ] Invariant cache hit.
[2023-03-23 03:53:59] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-23 03:53:59] [INFO ] After 524ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 03:53:59] [INFO ] After 637ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-23 03:54:00] [INFO ] After 840ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 97 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Support contains 5 out of 549 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 556 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 323 place count 478 transition count 713
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 332 rules applied. Total rules applied 655 place count 156 transition count 703
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 661 place count 151 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 662 place count 150 transition count 702
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 662 place count 150 transition count 681
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 704 place count 129 transition count 681
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 708 place count 125 transition count 677
Iterating global reduction 4 with 4 rules applied. Total rules applied 712 place count 125 transition count 677
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 760 place count 101 transition count 653
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 777 place count 84 transition count 292
Iterating global reduction 4 with 17 rules applied. Total rules applied 794 place count 84 transition count 292
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 801 place count 84 transition count 285
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 806 place count 79 transition count 275
Iterating global reduction 5 with 5 rules applied. Total rules applied 811 place count 79 transition count 275
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 816 place count 74 transition count 265
Iterating global reduction 5 with 5 rules applied. Total rules applied 821 place count 74 transition count 265
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 839 place count 65 transition count 272
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 840 place count 64 transition count 262
Iterating global reduction 5 with 1 rules applied. Total rules applied 841 place count 64 transition count 262
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 846 place count 64 transition count 257
Applied a total of 846 rules in 88 ms. Remains 64 /549 variables (removed 485) and now considering 257/1116 (removed 859) transitions.
[2023-03-23 03:54:00] [INFO ] Flow matrix only has 251 transitions (discarded 6 similar events)
// Phase 1: matrix 251 rows 64 cols
[2023-03-23 03:54:00] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 03:54:00] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-23 03:54:00] [INFO ] Flow matrix only has 251 transitions (discarded 6 similar events)
[2023-03-23 03:54:00] [INFO ] Invariant cache hit.
[2023-03-23 03:54:00] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-23 03:54:00] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-23 03:54:00] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-23 03:54:00] [INFO ] Flow matrix only has 251 transitions (discarded 6 similar events)
[2023-03-23 03:54:00] [INFO ] Invariant cache hit.
[2023-03-23 03:54:00] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/549 places, 257/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 569 ms. Remains : 64/549 places, 257/1116 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1116 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 173532 steps, run visited all 1 properties in 345 ms. (steps per millisecond=502 )
Probabilistic random walk after 173532 steps, saw 38941 distinct states, run finished after 346 ms. (steps per millisecond=501 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 5552 reset in 171 ms.
Product exploration explored 100000 steps with 11149 reset in 215 ms.
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 257/257 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 256
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 63 transition count 255
Applied a total of 3 rules in 10 ms. Remains 63 /64 variables (removed 1) and now considering 255/257 (removed 2) transitions.
[2023-03-23 03:54:02] [INFO ] Flow matrix only has 249 transitions (discarded 6 similar events)
// Phase 1: matrix 249 rows 63 cols
[2023-03-23 03:54:02] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 03:54:02] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-23 03:54:02] [INFO ] Flow matrix only has 249 transitions (discarded 6 similar events)
[2023-03-23 03:54:02] [INFO ] Invariant cache hit.
[2023-03-23 03:54:02] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-23 03:54:02] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-23 03:54:02] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 03:54:02] [INFO ] Flow matrix only has 249 transitions (discarded 6 similar events)
[2023-03-23 03:54:02] [INFO ] Invariant cache hit.
[2023-03-23 03:54:02] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/64 places, 255/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 502 ms. Remains : 63/64 places, 255/257 transitions.
Treatment of property StigmergyElection-PT-05b-LTLFireability-09 finished in 9716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(F(p0))))))'
Support contains 1 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 560 edges and 549 vertex of which 78 / 549 are part of one of the 14 SCC in 2 ms
Free SCC test removed 64 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 484 transition count 711
Reduce places removed 331 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 343 rules applied. Total rules applied 675 place count 153 transition count 699
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 682 place count 147 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 683 place count 146 transition count 698
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 683 place count 146 transition count 676
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 727 place count 124 transition count 676
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 731 place count 120 transition count 672
Iterating global reduction 4 with 4 rules applied. Total rules applied 735 place count 120 transition count 672
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 783 place count 96 transition count 648
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 802 place count 77 transition count 213
Iterating global reduction 4 with 19 rules applied. Total rules applied 821 place count 77 transition count 213
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 831 place count 77 transition count 203
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 835 place count 73 transition count 195
Iterating global reduction 5 with 4 rules applied. Total rules applied 839 place count 73 transition count 195
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 843 place count 69 transition count 187
Iterating global reduction 5 with 4 rules applied. Total rules applied 847 place count 69 transition count 187
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 867 place count 59 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 868 place count 58 transition count 182
Iterating global reduction 5 with 1 rules applied. Total rules applied 869 place count 58 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 870 place count 58 transition count 181
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 875 place count 58 transition count 176
Applied a total of 875 rules in 65 ms. Remains 58 /549 variables (removed 491) and now considering 176/1116 (removed 940) transitions.
[2023-03-23 03:54:03] [INFO ] Flow matrix only has 170 transitions (discarded 6 similar events)
// Phase 1: matrix 170 rows 58 cols
[2023-03-23 03:54:03] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 03:54:03] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-23 03:54:03] [INFO ] Flow matrix only has 170 transitions (discarded 6 similar events)
[2023-03-23 03:54:03] [INFO ] Invariant cache hit.
[2023-03-23 03:54:03] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-23 03:54:03] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-23 03:54:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 03:54:03] [INFO ] Flow matrix only has 170 transitions (discarded 6 similar events)
[2023-03-23 03:54:03] [INFO ] Invariant cache hit.
[2023-03-23 03:54:03] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/549 places, 176/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 561 ms. Remains : 58/549 places, 176/1116 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-10 finished in 615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
Support contains 10 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 11 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2023-03-23 03:54:03] [INFO ] Computed 6 place invariants in 11 ms
[2023-03-23 03:54:03] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-23 03:54:03] [INFO ] Invariant cache hit.
[2023-03-23 03:54:04] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
[2023-03-23 03:54:04] [INFO ] Invariant cache hit.
[2023-03-23 03:54:05] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1808 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s58 1) (EQ s164 1) (EQ s270 1) (EQ s398 1) (EQ s482 1)), p1:(AND (EQ s44 1) (EQ s150 1) (EQ s234 1) (EQ s340 1) (EQ s446 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 94 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-11 finished in 1990 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||X((F(p1)||G(p2))))))'
Support contains 7 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 11 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-23 03:54:05] [INFO ] Invariant cache hit.
[2023-03-23 03:54:06] [INFO ] Implicit Places using invariants in 513 ms returned []
[2023-03-23 03:54:06] [INFO ] Invariant cache hit.
[2023-03-23 03:54:06] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
[2023-03-23 03:54:06] [INFO ] Invariant cache hit.
[2023-03-23 03:54:07] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2049 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s236 1), p0:(AND (EQ s236 0) (EQ s34 0)), p2:(AND (EQ s80 1) (EQ s164 1) (EQ s281 1) (EQ s398 1) (EQ s493 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]]
Product exploration explored 100000 steps with 50000 reset in 456 ms.
Product exploration explored 100000 steps with 50000 reset in 464 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05b-LTLFireability-12 finished in 3237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&(p0 U p1)&&X((!p0 U p2)))))'
Support contains 9 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 11 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-23 03:54:08] [INFO ] Invariant cache hit.
[2023-03-23 03:54:09] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-23 03:54:09] [INFO ] Invariant cache hit.
[2023-03-23 03:54:09] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2023-03-23 03:54:10] [INFO ] Invariant cache hit.
[2023-03-23 03:54:10] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1958 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s33 1) (EQ s139 1) (EQ s245 1) (EQ s351 1) (EQ s468 1)), p1:(AND (EQ s33 1) (EQ s150 1) (EQ s245 1) (EQ s362 1) (EQ s446 1)), p2:(AND (EQ s44 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-14 finished in 2260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(X(p1)||F(p2)))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 13 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-23 03:54:11] [INFO ] Invariant cache hit.
[2023-03-23 03:54:11] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-23 03:54:11] [INFO ] Invariant cache hit.
[2023-03-23 03:54:12] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1301 ms to find 0 implicit places.
[2023-03-23 03:54:12] [INFO ] Invariant cache hit.
[2023-03-23 03:54:13] [INFO ] Dead Transitions using invariants and state equation in 1008 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2336 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s372 1), p2:(AND (EQ s33 1) (EQ s128 1) (EQ s234 1) (EQ s351 1) (EQ s468 1)), p1:(OR (EQ s33 0) (EQ s128 0) (EQ s234 0) (EQ s351 0) (EQ s468 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-15 finished in 2495 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&&X(p1)))))'
Found a Shortening insensitive property : StigmergyElection-PT-05b-LTLFireability-00
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 558 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 325 transitions
Trivial Post-agglo rules discarded 325 transitions
Performed 325 trivial Post agglomeration. Transition count delta: 325
Iterating post reduction 0 with 325 rules applied. Total rules applied 326 place count 478 transition count 710
Reduce places removed 325 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 335 rules applied. Total rules applied 661 place count 153 transition count 700
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 667 place count 148 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 668 place count 147 transition count 699
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 668 place count 147 transition count 678
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 710 place count 126 transition count 678
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 714 place count 122 transition count 674
Iterating global reduction 4 with 4 rules applied. Total rules applied 718 place count 122 transition count 674
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 766 place count 98 transition count 650
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 786 place count 78 transition count 213
Iterating global reduction 4 with 20 rules applied. Total rules applied 806 place count 78 transition count 213
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 816 place count 78 transition count 203
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 820 place count 74 transition count 195
Iterating global reduction 5 with 4 rules applied. Total rules applied 824 place count 74 transition count 195
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 828 place count 70 transition count 187
Iterating global reduction 5 with 4 rules applied. Total rules applied 832 place count 70 transition count 187
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 850 place count 61 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 851 place count 60 transition count 183
Iterating global reduction 5 with 1 rules applied. Total rules applied 852 place count 60 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 853 place count 60 transition count 182
Applied a total of 853 rules in 67 ms. Remains 60 /549 variables (removed 489) and now considering 182/1116 (removed 934) transitions.
[2023-03-23 03:54:13] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
// Phase 1: matrix 176 rows 60 cols
[2023-03-23 03:54:13] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 03:54:14] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-23 03:54:14] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-23 03:54:14] [INFO ] Invariant cache hit.
[2023-03-23 03:54:14] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-23 03:54:14] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-23 03:54:14] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-23 03:54:14] [INFO ] Invariant cache hit.
[2023-03-23 03:54:14] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 60/549 places, 182/1116 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 560 ms. Remains : 60/549 places, 182/1116 transitions.
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s52 1), p1:(NEQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33588 reset in 254 ms.
Product exploration explored 100000 steps with 33551 reset in 329 ms.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 409 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1101 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-23 03:54:15] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-23 03:54:15] [INFO ] Invariant cache hit.
[2023-03-23 03:54:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 03:54:15] [INFO ] After 62ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 03:54:15] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-23 03:54:15] [INFO ] After 18ms SMT Verify possible using 31 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 03:54:15] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 03:54:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 03:54:15] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 03:54:15] [INFO ] After 17ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 03:54:15] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-23 03:54:15] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 182/182 transitions.
Graph (complete) has 321 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 59 transition count 170
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 1 with 20 rules applied. Total rules applied 32 place count 49 transition count 160
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 38 place count 49 transition count 154
Free-agglomeration rule applied 26 times.
Iterating global reduction 2 with 26 rules applied. Total rules applied 64 place count 49 transition count 128
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 100 place count 22 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 100 place count 22 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 21 transition count 118
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 107 place count 16 transition count 113
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 16 transition count 113
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 135 place count 16 transition count 90
Performed 5 Post agglomeration using F-continuation condition with reduction of 63 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 147 place count 9 transition count 22
Drop transitions removed 5 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 161 place count 9 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 8 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 165 place count 6 transition count 6
Applied a total of 165 rules in 17 ms. Remains 6 /60 variables (removed 54) and now considering 6/182 (removed 176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 6/60 places, 6/182 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 483 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 182/182 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-23 03:54:16] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-23 03:54:16] [INFO ] Invariant cache hit.
[2023-03-23 03:54:16] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-23 03:54:16] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-23 03:54:16] [INFO ] Invariant cache hit.
[2023-03-23 03:54:16] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-23 03:54:16] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-23 03:54:16] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-23 03:54:16] [INFO ] Invariant cache hit.
[2023-03-23 03:54:17] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 60/60 places, 182/182 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 300 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1111 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 03:54:17] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-23 03:54:17] [INFO ] Invariant cache hit.
[2023-03-23 03:54:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 03:54:17] [INFO ] After 62ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 03:54:17] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-23 03:54:17] [INFO ] After 16ms SMT Verify possible using 31 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 03:54:17] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 03:54:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 03:54:17] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 03:54:17] [INFO ] After 17ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 03:54:17] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 03:54:17] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 182/182 transitions.
Graph (complete) has 321 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 59 transition count 170
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 1 with 20 rules applied. Total rules applied 32 place count 49 transition count 160
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 38 place count 49 transition count 154
Free-agglomeration rule applied 26 times.
Iterating global reduction 2 with 26 rules applied. Total rules applied 64 place count 49 transition count 128
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 100 place count 22 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 100 place count 22 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 21 transition count 118
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 107 place count 16 transition count 113
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 16 transition count 113
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 135 place count 16 transition count 90
Performed 5 Post agglomeration using F-continuation condition with reduction of 63 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 147 place count 9 transition count 22
Drop transitions removed 5 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 161 place count 9 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 8 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 165 place count 6 transition count 6
Applied a total of 165 rules in 13 ms. Remains 6 /60 variables (removed 54) and now considering 6/182 (removed 176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 6/60 places, 6/182 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 515 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33532 reset in 323 ms.
Product exploration explored 100000 steps with 33592 reset in 284 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 182/182 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-23 03:54:19] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-23 03:54:19] [INFO ] Invariant cache hit.
[2023-03-23 03:54:19] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-23 03:54:19] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-23 03:54:19] [INFO ] Invariant cache hit.
[2023-03-23 03:54:19] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-23 03:54:19] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-23 03:54:19] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-23 03:54:19] [INFO ] Invariant cache hit.
[2023-03-23 03:54:19] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 368 ms. Remains : 60/60 places, 182/182 transitions.
Treatment of property StigmergyElection-PT-05b-LTLFireability-00 finished in 6240 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&&G(F(p1))))))'
[2023-03-23 03:54:20] [INFO ] Flatten gal took : 74 ms
[2023-03-23 03:54:20] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-23 03:54:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 549 places, 1116 transitions and 6441 arcs took 14 ms.
Total runtime 69984 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1468/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1468/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : StigmergyElection-PT-05b-LTLFireability-00
Could not compute solution for formula : StigmergyElection-PT-05b-LTLFireability-09

BK_STOP 1679543661948

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name StigmergyElection-PT-05b-LTLFireability-00
ltl formula formula --ltl=/tmp/1468/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 549 places, 1116 transitions and 6441 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.030 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1468/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1468/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1468/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1468/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name StigmergyElection-PT-05b-LTLFireability-09
ltl formula formula --ltl=/tmp/1468/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 549 places, 1116 transitions and 6441 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.050 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1468/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1468/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1468/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1468/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-05b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is StigmergyElection-PT-05b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r457-smll-167912649500612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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