About the Execution of ITS-Tools for StigmergyElection-PT-03b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 439.644 | 30662.00 | 61881.00 | 306.20 | FFTTFFFTTTTFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872700275.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyElection-PT-03b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872700275
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.7K May 30 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 30 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 30 14:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 30 14:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 8.5K May 30 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K May 30 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 30 14:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 117K May 29 12:20 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-03b-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-03b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1654841251582
Running Version 202205111006
[2022-06-10 06:07:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 06:07:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 06:07:34] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2022-06-10 06:07:34] [INFO ] Transformed 427 places.
[2022-06-10 06:07:34] [INFO ] Transformed 518 transitions.
[2022-06-10 06:07:34] [INFO ] Found NUPN structural information;
[2022-06-10 06:07:34] [INFO ] Parsed PT model containing 427 places and 518 transitions in 453 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 50 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA StigmergyElection-PT-03b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 427 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 427/427 places, 518/518 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 381 transition count 472
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 381 transition count 472
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 112 place count 361 transition count 452
Iterating global reduction 0 with 20 rules applied. Total rules applied 132 place count 361 transition count 452
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 136 place count 357 transition count 448
Iterating global reduction 0 with 4 rules applied. Total rules applied 140 place count 357 transition count 448
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 142 place count 355 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 144 place count 355 transition count 446
Applied a total of 144 rules in 253 ms. Remains 355 /427 variables (removed 72) and now considering 446/518 (removed 72) transitions.
// Phase 1: matrix 446 rows 355 cols
[2022-06-10 06:07:35] [INFO ] Computed 4 place invariants in 85 ms
[2022-06-10 06:07:35] [INFO ] Implicit Places using invariants in 508 ms returned []
// Phase 1: matrix 446 rows 355 cols
[2022-06-10 06:07:35] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-10 06:07:36] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 355 cols
[2022-06-10 06:07:36] [INFO ] Computed 4 place invariants in 11 ms
[2022-06-10 06:07:36] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 355/427 places, 446/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 355/427 places, 446/518 transitions.
Support contains 38 out of 355 places after structural reductions.
[2022-06-10 06:07:36] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-06-10 06:07:37] [INFO ] Flatten gal took : 129 ms
FORMULA StigmergyElection-PT-03b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-10 06:07:37] [INFO ] Flatten gal took : 57 ms
[2022-06-10 06:07:37] [INFO ] Input system was already deterministic with 446 transitions.
Support contains 35 out of 355 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 168 resets, run finished after 1149 ms. (steps per millisecond=8 ) properties (out of 21) seen :12
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 446 rows 355 cols
[2022-06-10 06:07:39] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:07:39] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-10 06:07:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2022-06-10 06:07:40] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2022-06-10 06:07:41] [INFO ] Deduced a trap composed of 174 places in 246 ms of which 18 ms to minimize.
[2022-06-10 06:07:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2022-06-10 06:07:41] [INFO ] After 1151ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 170 ms.
[2022-06-10 06:07:41] [INFO ] After 2051ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 3 different solutions.
Finished Parikh walk after 124 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
Parikh walk visited 5 properties in 13 ms.
FORMULA StigmergyElection-PT-03b-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 7 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyElection-PT-03b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 48 stabilizing places and 51 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 2 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 446/446 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 345 transition count 436
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 345 transition count 436
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 339 transition count 430
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 339 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 338 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 338 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 337 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 337 transition count 428
Applied a total of 36 rules in 101 ms. Remains 337 /355 variables (removed 18) and now considering 428/446 (removed 18) transitions.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:07:42] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-10 06:07:42] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:07:42] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:07:42] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:07:42] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:07:43] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/355 places, 428/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 337/355 places, 428/446 transitions.
Stuttering acceptance computed with spot in 342 ms :[true, p0, p0, p0]
Running random walk in product with property : StigmergyElection-PT-03b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s253 0) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-03b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLCardinality-01 finished in 1856 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((X(p0)||p1)))||X(p2)))'
Support contains 6 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 446/446 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 438
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 438
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 341 transition count 432
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 341 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 340 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 340 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 339 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 339 transition count 430
Applied a total of 32 rules in 109 ms. Remains 339 /355 variables (removed 16) and now considering 430/446 (removed 16) transitions.
// Phase 1: matrix 430 rows 339 cols
[2022-06-10 06:07:43] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-10 06:07:44] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 430 rows 339 cols
[2022-06-10 06:07:44] [INFO ] Computed 4 place invariants in 7 ms
[2022-06-10 06:07:44] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
// Phase 1: matrix 430 rows 339 cols
[2022-06-10 06:07:44] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-10 06:07:45] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 339/355 places, 430/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 339/355 places, 430/446 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s97 0) (EQ s11 1)), p2:(OR (EQ s118 0) (EQ s142 1)), p0:(AND (EQ s54 0) (EQ s151 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 673 ms.
Product exploration explored 100000 steps with 50000 reset in 475 ms.
Computed a total of 46 stabilizing places and 49 stable transitions
Computed a total of 46 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p2), true, (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 5 factoid took 341 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyElection-PT-03b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03b-LTLCardinality-03 finished in 3060 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F((G(p0)||G(p1)))))))'
Support contains 4 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 446/446 transitions.
Graph (trivial) has 355 edges and 355 vertex of which 55 / 355 are part of one of the 9 SCC in 4 ms
Free SCC test removed 46 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 208 place count 308 transition count 186
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 213 rules applied. Total rules applied 421 place count 101 transition count 180
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 427 place count 98 transition count 177
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 430 place count 95 transition count 177
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 430 place count 95 transition count 166
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 452 place count 84 transition count 166
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 459 place count 77 transition count 158
Iterating global reduction 4 with 7 rules applied. Total rules applied 466 place count 77 transition count 158
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 467 place count 77 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 468 place count 76 transition count 157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 468 place count 76 transition count 155
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 472 place count 74 transition count 155
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 474 place count 72 transition count 144
Iterating global reduction 6 with 2 rules applied. Total rules applied 476 place count 72 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 477 place count 72 transition count 143
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 478 place count 71 transition count 141
Iterating global reduction 7 with 1 rules applied. Total rules applied 479 place count 71 transition count 141
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 7 with 20 rules applied. Total rules applied 499 place count 61 transition count 131
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 509 place count 51 transition count 95
Iterating global reduction 7 with 10 rules applied. Total rules applied 519 place count 51 transition count 95
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 524 place count 51 transition count 90
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 525 place count 50 transition count 88
Iterating global reduction 8 with 1 rules applied. Total rules applied 526 place count 50 transition count 88
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 527 place count 49 transition count 86
Iterating global reduction 8 with 1 rules applied. Total rules applied 528 place count 49 transition count 86
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 544 place count 41 transition count 98
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 545 place count 40 transition count 91
Iterating global reduction 8 with 1 rules applied. Total rules applied 546 place count 40 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 547 place count 40 transition count 90
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 550 place count 40 transition count 87
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 551 place count 40 transition count 87
Applied a total of 551 rules in 87 ms. Remains 40 /355 variables (removed 315) and now considering 87/446 (removed 359) transitions.
[2022-06-10 06:07:47] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 40 cols
[2022-06-10 06:07:47] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 06:07:47] [INFO ] Implicit Places using invariants in 732 ms returned []
[2022-06-10 06:07:47] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 40 cols
[2022-06-10 06:07:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:07:47] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 06:07:47] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2022-06-10 06:07:47] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 06:07:47] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 40 cols
[2022-06-10 06:07:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:07:47] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/355 places, 87/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/355 places, 87/446 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s14 0) (EQ s33 1)), p1:(OR (EQ s29 0) (EQ s11 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33 reset in 303 ms.
Product exploration explored 100000 steps with 36 reset in 179 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 562 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1305 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 262 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-10 06:07:49] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 40 cols
[2022-06-10 06:07:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:07:49] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:07:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 06:07:49] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 06:07:49] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 06:07:49] [INFO ] After 13ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 06:07:49] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 3 ms to minimize.
[2022-06-10 06:07:49] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 5 ms to minimize.
[2022-06-10 06:07:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2022-06-10 06:07:49] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-10 06:07:49] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 87/87 transitions.
Graph (complete) has 135 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 39 transition count 81
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 36 transition count 78
Free-agglomeration rule applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 28 place count 36 transition count 62
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 50 place count 19 transition count 57
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 16 transition count 54
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 16 transition count 54
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 59 place count 16 transition count 51
Performed 3 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 13 transition count 40
Drop transitions removed 3 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 82 place count 13 transition count 23
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 4 with 2 rules applied. Total rules applied 84 place count 12 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 12 transition count 21
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 12 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 12 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 11 transition count 19
Applied a total of 88 rules in 47 ms. Remains 11 /40 variables (removed 29) and now considering 19/87 (removed 68) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/40 places, 19/87 transitions.
Incomplete random walk after 10000 steps, including 1029 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 370 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Probably explored full state space saw : 38 states, properties seen :0
Probabilistic random walk after 92 steps, saw 38 distinct states, run finished after 13 ms. (steps per millisecond=7 ) properties seen :0
Explored full state space saw : 38 states, properties seen :0
Exhaustive walk after 92 steps, saw 38 distinct states, run finished after 3 ms. (steps per millisecond=30 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 754 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 87/87 transitions.
Applied a total of 0 rules in 8 ms. Remains 40 /40 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2022-06-10 06:07:50] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 40 cols
[2022-06-10 06:07:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:07:50] [INFO ] Implicit Places using invariants in 49 ms returned []
[2022-06-10 06:07:50] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 40 cols
[2022-06-10 06:07:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:07:50] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 06:07:50] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2022-06-10 06:07:50] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 06:07:50] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 40 cols
[2022-06-10 06:07:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:07:51] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 87/87 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 421 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1292 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 259 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-10 06:07:51] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 40 cols
[2022-06-10 06:07:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:07:51] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:07:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 06:07:51] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 06:07:51] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 06:07:51] [INFO ] After 15ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 06:07:51] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 2 ms to minimize.
[2022-06-10 06:07:52] [INFO ] Deduced a trap composed of 21 places in 414 ms of which 31 ms to minimize.
[2022-06-10 06:07:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 622 ms
[2022-06-10 06:07:52] [INFO ] After 644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-10 06:07:52] [INFO ] After 791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 87/87 transitions.
Graph (complete) has 135 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 39 transition count 81
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 36 transition count 78
Free-agglomeration rule applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 28 place count 36 transition count 62
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 50 place count 19 transition count 57
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 16 transition count 54
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 16 transition count 54
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 59 place count 16 transition count 51
Performed 3 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 13 transition count 40
Drop transitions removed 3 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 82 place count 13 transition count 23
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 4 with 2 rules applied. Total rules applied 84 place count 12 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 12 transition count 21
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 12 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 12 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 11 transition count 19
Applied a total of 88 rules in 24 ms. Remains 11 /40 variables (removed 29) and now considering 19/87 (removed 68) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/40 places, 19/87 transitions.
Incomplete random walk after 10000 steps, including 997 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 373 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Probably explored full state space saw : 38 states, properties seen :0
Probabilistic random walk after 92 steps, saw 38 distinct states, run finished after 5 ms. (steps per millisecond=18 ) properties seen :0
Explored full state space saw : 38 states, properties seen :0
Exhaustive walk after 92 steps, saw 38 distinct states, run finished after 1 ms. (steps per millisecond=92 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 461 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 48 reset in 164 ms.
Product exploration explored 100000 steps with 4 reset in 250 ms.
Built C files in :
/tmp/ltsmin17780596628642775572
[2022-06-10 06:07:53] [INFO ] Computing symmetric may disable matrix : 87 transitions.
[2022-06-10 06:07:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:07:53] [INFO ] Computing symmetric may enable matrix : 87 transitions.
[2022-06-10 06:07:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:07:53] [INFO ] Computing Do-Not-Accords matrix : 87 transitions.
[2022-06-10 06:07:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:07:53] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17780596628642775572
Running compilation step : cd /tmp/ltsmin17780596628642775572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 627 ms.
Running link step : cd /tmp/ltsmin17780596628642775572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin17780596628642775572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16532996491901352253.hoa' '--buchi-type=spotba'
LTSmin run took 225 ms.
FORMULA StigmergyElection-PT-03b-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-03b-LTLCardinality-07 finished in 7618 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(X(X(p0)))))||X(p1)))'
Support contains 4 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 446/446 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 345 transition count 436
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 345 transition count 436
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 339 transition count 430
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 339 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 338 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 338 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 337 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 337 transition count 428
Applied a total of 36 rules in 28 ms. Remains 337 /355 variables (removed 18) and now considering 428/446 (removed 18) transitions.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:07:54] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:07:54] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:07:54] [INFO ] Computed 4 place invariants in 9 ms
[2022-06-10 06:07:54] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:07:54] [INFO ] Computed 4 place invariants in 7 ms
[2022-06-10 06:07:55] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/355 places, 428/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 337/355 places, 428/446 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (EQ s294 0) (EQ s224 1)), p0:(OR (EQ s88 0) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1436 reset in 129 ms.
Product exploration explored 100000 steps with 733 reset in 210 ms.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 172 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1356885 steps, run timeout after 3001 ms. (steps per millisecond=452 ) properties seen :{}
Probabilistic random walk after 1356885 steps, saw 294331 distinct states, run finished after 3001 ms. (steps per millisecond=452 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:07:59] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:07:59] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:07:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-06-10 06:07:59] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 06:07:59] [INFO ] Deduced a trap composed of 165 places in 259 ms of which 1 ms to minimize.
[2022-06-10 06:07:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2022-06-10 06:07:59] [INFO ] After 576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-10 06:07:59] [INFO ] After 677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 337 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 337/337 places, 428/428 transitions.
Graph (trivial) has 341 edges and 337 vertex of which 53 / 337 are part of one of the 9 SCC in 1 ms
Free SCC test removed 44 places
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Graph (complete) has 499 edges and 293 vertex of which 290 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 206 rules applied. Total rules applied 208 place count 290 transition count 163
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 209 rules applied. Total rules applied 417 place count 87 transition count 157
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 421 place count 84 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 83 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 422 place count 83 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 454 place count 67 transition count 140
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 455 place count 67 transition count 139
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 487 place count 51 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 493 place count 51 transition count 117
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 506 place count 38 transition count 67
Iterating global reduction 6 with 13 rules applied. Total rules applied 519 place count 38 transition count 67
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 526 place count 38 transition count 60
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 529 place count 35 transition count 57
Iterating global reduction 7 with 3 rules applied. Total rules applied 532 place count 35 transition count 57
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 538 place count 32 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 542 place count 30 transition count 56
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 546 place count 30 transition count 52
Free-agglomeration rule applied 15 times.
Iterating global reduction 7 with 15 rules applied. Total rules applied 561 place count 30 transition count 37
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 581 place count 15 transition count 32
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 584 place count 12 transition count 29
Iterating global reduction 8 with 3 rules applied. Total rules applied 587 place count 12 transition count 29
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 590 place count 12 transition count 26
Applied a total of 590 rules in 27 ms. Remains 12 /337 variables (removed 325) and now considering 26/428 (removed 402) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/337 places, 26/428 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 337 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 : 337/337 places, 428/428 transitions.
Graph (trivial) has 337 edges and 337 vertex of which 50 / 337 are part of one of the 9 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 197 place count 295 transition count 185
Reduce places removed 196 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 202 rules applied. Total rules applied 399 place count 99 transition count 179
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 404 place count 96 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 406 place count 94 transition count 177
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 406 place count 94 transition count 164
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 432 place count 81 transition count 164
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 434 place count 79 transition count 162
Iterating global reduction 4 with 2 rules applied. Total rules applied 436 place count 79 transition count 162
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 464 place count 65 transition count 148
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 475 place count 54 transition count 103
Iterating global reduction 4 with 11 rules applied. Total rules applied 486 place count 54 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 491 place count 54 transition count 98
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 493 place count 52 transition count 94
Iterating global reduction 5 with 2 rules applied. Total rules applied 495 place count 52 transition count 94
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 497 place count 50 transition count 90
Iterating global reduction 5 with 2 rules applied. Total rules applied 499 place count 50 transition count 90
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 519 place count 40 transition count 104
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 520 place count 39 transition count 96
Iterating global reduction 5 with 1 rules applied. Total rules applied 521 place count 39 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 522 place count 39 transition count 95
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 526 place count 39 transition count 91
Applied a total of 526 rules in 28 ms. Remains 39 /337 variables (removed 298) and now considering 91/428 (removed 337) transitions.
[2022-06-10 06:08:00] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
// Phase 1: matrix 86 rows 39 cols
[2022-06-10 06:08:00] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:08:00] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-06-10 06:08:00] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
// Phase 1: matrix 86 rows 39 cols
[2022-06-10 06:08:00] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:08:00] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 06:08:00] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-06-10 06:08:00] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 06:08:00] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
// Phase 1: matrix 86 rows 39 cols
[2022-06-10 06:08:00] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 06:08:00] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/337 places, 91/428 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/337 places, 91/428 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 3938 steps, including 595 resets, run visited all 1 properties in 24 ms. (steps per millisecond=164 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 297 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 17 reset in 57 ms.
Product exploration explored 100000 steps with 61 reset in 63 ms.
Built C files in :
/tmp/ltsmin17734462225435438274
[2022-06-10 06:08:01] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2022-06-10 06:08:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:08:01] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2022-06-10 06:08:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:08:01] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2022-06-10 06:08:01] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:08:01] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17734462225435438274
Running compilation step : cd /tmp/ltsmin17734462225435438274;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 254 ms.
Running link step : cd /tmp/ltsmin17734462225435438274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin17734462225435438274;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14663118323421970342.hoa' '--buchi-type=spotba'
LTSmin run took 78 ms.
FORMULA StigmergyElection-PT-03b-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-03b-LTLCardinality-12 finished in 6939 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&p1)) U p2))'
Support contains 4 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 446/446 transitions.
Graph (trivial) has 357 edges and 355 vertex of which 55 / 355 are part of one of the 9 SCC in 1 ms
Free SCC test removed 46 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 209 place count 308 transition count 185
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 214 rules applied. Total rules applied 423 place count 100 transition count 179
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 428 place count 97 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 430 place count 95 transition count 177
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 430 place count 95 transition count 165
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 454 place count 83 transition count 165
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 460 place count 77 transition count 158
Iterating global reduction 4 with 6 rules applied. Total rules applied 466 place count 77 transition count 158
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 467 place count 77 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 468 place count 76 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 468 place count 76 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 470 place count 75 transition count 156
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 472 place count 73 transition count 145
Iterating global reduction 6 with 2 rules applied. Total rules applied 474 place count 73 transition count 145
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 475 place count 72 transition count 143
Iterating global reduction 6 with 1 rules applied. Total rules applied 476 place count 72 transition count 143
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 498 place count 61 transition count 132
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 507 place count 52 transition count 97
Iterating global reduction 6 with 9 rules applied. Total rules applied 516 place count 52 transition count 97
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 521 place count 52 transition count 92
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 523 place count 50 transition count 88
Iterating global reduction 7 with 2 rules applied. Total rules applied 525 place count 50 transition count 88
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 526 place count 49 transition count 86
Iterating global reduction 7 with 1 rules applied. Total rules applied 527 place count 49 transition count 86
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 545 place count 40 transition count 102
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 546 place count 39 transition count 94
Iterating global reduction 7 with 1 rules applied. Total rules applied 547 place count 39 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 548 place count 39 transition count 93
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 552 place count 39 transition count 89
Applied a total of 552 rules in 29 ms. Remains 39 /355 variables (removed 316) and now considering 89/446 (removed 357) transitions.
[2022-06-10 06:08:01] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
// Phase 1: matrix 85 rows 39 cols
[2022-06-10 06:08:01] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:08:01] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-06-10 06:08:01] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
// Phase 1: matrix 85 rows 39 cols
[2022-06-10 06:08:01] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:08:01] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 06:08:01] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2022-06-10 06:08:01] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 06:08:01] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
// Phase 1: matrix 85 rows 39 cols
[2022-06-10 06:08:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:08:01] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/355 places, 89/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/355 places, 89/446 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p2), true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s30 1) (EQ s19 1)), p1:(OR (EQ s5 0) (EQ s27 1) (EQ s19 1)), p0:(OR (EQ s5 0) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 2 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLCardinality-13 finished in 474 ms.
All properties solved by simple procedures.
Total runtime 27941 ms.
BK_STOP 1654841282244
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-03b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-03b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872700275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-03b.tgz
mv StigmergyElection-PT-03b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;