About the Execution of ITS-Tools for StigmergyElection-PT-04b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3566.203 | 306728.00 | 962678.00 | 846.70 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r453-smll-167912645700596.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is StigmergyElection-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645700596
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 6.8K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 203K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679412670267
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-04b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-21 15:31:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 15:31:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 15:31:13] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2023-03-21 15:31:13] [INFO ] Transformed 563 places.
[2023-03-21 15:31:13] [INFO ] Transformed 780 transitions.
[2023-03-21 15:31:13] [INFO ] Found NUPN structural information;
[2023-03-21 15:31:13] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyElection-PT-04b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 780/780 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 496 transition count 713
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 496 transition count 713
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 168 place count 462 transition count 679
Iterating global reduction 0 with 34 rules applied. Total rules applied 202 place count 462 transition count 679
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 207 place count 457 transition count 674
Iterating global reduction 0 with 5 rules applied. Total rules applied 212 place count 457 transition count 674
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 214 place count 455 transition count 672
Iterating global reduction 0 with 2 rules applied. Total rules applied 216 place count 455 transition count 672
Applied a total of 216 rules in 191 ms. Remains 455 /563 variables (removed 108) and now considering 672/780 (removed 108) transitions.
// Phase 1: matrix 672 rows 455 cols
[2023-03-21 15:31:13] [INFO ] Computed 5 place invariants in 34 ms
[2023-03-21 15:31:14] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-21 15:31:14] [INFO ] Invariant cache hit.
[2023-03-21 15:31:15] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
[2023-03-21 15:31:15] [INFO ] Invariant cache hit.
[2023-03-21 15:31:15] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/563 places, 672/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2100 ms. Remains : 455/563 places, 672/780 transitions.
Support contains 39 out of 455 places after structural reductions.
[2023-03-21 15:31:16] [INFO ] Flatten gal took : 137 ms
[2023-03-21 15:31:16] [INFO ] Flatten gal took : 68 ms
[2023-03-21 15:31:16] [INFO ] Input system was already deterministic with 672 transitions.
Support contains 34 out of 455 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 674 ms. (steps per millisecond=14 ) properties (out of 28) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-21 15:31:17] [INFO ] Invariant cache hit.
[2023-03-21 15:31:17] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-21 15:31:18] [INFO ] After 520ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:7
[2023-03-21 15:31:18] [INFO ] Deduced a trap composed of 164 places in 287 ms of which 9 ms to minimize.
[2023-03-21 15:31:18] [INFO ] Deduced a trap composed of 168 places in 302 ms of which 1 ms to minimize.
[2023-03-21 15:31:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 706 ms
[2023-03-21 15:31:19] [INFO ] Deduced a trap composed of 167 places in 210 ms of which 1 ms to minimize.
[2023-03-21 15:31:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-21 15:31:19] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 2 ms to minimize.
[2023-03-21 15:31:19] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 2 ms to minimize.
[2023-03-21 15:31:20] [INFO ] Deduced a trap composed of 163 places in 175 ms of which 1 ms to minimize.
[2023-03-21 15:31:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 676 ms
[2023-03-21 15:31:20] [INFO ] After 2578ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-21 15:31:20] [INFO ] After 3028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-21 15:31:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-21 15:31:21] [INFO ] After 711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-21 15:31:21] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 1 ms to minimize.
[2023-03-21 15:31:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-21 15:31:22] [INFO ] Deduced a trap composed of 171 places in 182 ms of which 2 ms to minimize.
[2023-03-21 15:31:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-21 15:31:22] [INFO ] Deduced a trap composed of 169 places in 220 ms of which 1 ms to minimize.
[2023-03-21 15:31:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-21 15:31:22] [INFO ] Deduced a trap composed of 166 places in 168 ms of which 0 ms to minimize.
[2023-03-21 15:31:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-21 15:31:23] [INFO ] After 2283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 404 ms.
[2023-03-21 15:31:23] [INFO ] After 3187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 9 properties in 70 ms.
Support contains 6 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 672/672 transitions.
Graph (trivial) has 454 edges and 455 vertex of which 67 / 455 are part of one of the 11 SCC in 5 ms
Free SCC test removed 56 places
Drop transitions removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Graph (complete) has 763 edges and 399 vertex of which 396 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 278 rules applied. Total rules applied 280 place count 396 transition count 320
Reduce places removed 275 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 283 rules applied. Total rules applied 563 place count 121 transition count 312
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 570 place count 117 transition count 309
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 573 place count 114 transition count 309
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 573 place count 114 transition count 290
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 611 place count 95 transition count 290
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 647 place count 77 transition count 272
Drop transitions removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 654 place count 77 transition count 265
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 667 place count 64 transition count 123
Iterating global reduction 5 with 13 rules applied. Total rules applied 680 place count 64 transition count 123
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 689 place count 64 transition count 114
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 691 place count 62 transition count 112
Iterating global reduction 6 with 2 rules applied. Total rules applied 693 place count 62 transition count 112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 705 place count 56 transition count 106
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 715 place count 51 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 716 place count 51 transition count 119
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 724 place count 51 transition count 111
Free-agglomeration rule applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 745 place count 51 transition count 90
Reduce places removed 21 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 26 rules applied. Total rules applied 771 place count 30 transition count 85
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 775 place count 26 transition count 81
Iterating global reduction 8 with 4 rules applied. Total rules applied 779 place count 26 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 782 place count 26 transition count 78
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 789 place count 26 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 790 place count 25 transition count 70
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 792 place count 24 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 793 place count 23 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 793 place count 23 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 795 place count 22 transition count 68
Performed 4 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 803 place count 18 transition count 47
Drop transitions removed 4 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 823 place count 18 transition count 27
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 827 place count 16 transition count 26
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 830 place count 16 transition count 23
Applied a total of 830 rules in 138 ms. Remains 16 /455 variables (removed 439) and now considering 23/672 (removed 649) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 16/455 places, 23/672 transitions.
Finished random walk after 3349 steps, including 1 resets, run visited all 6 properties in 38 ms. (steps per millisecond=88 )
FORMULA StigmergyElection-PT-04b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 60 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X(X(!(F(p2)&&p1)))))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 672/672 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 450 transition count 667
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 450 transition count 667
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 445 transition count 662
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 445 transition count 662
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 443 transition count 660
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 442 transition count 659
Applied a total of 26 rules in 79 ms. Remains 442 /455 variables (removed 13) and now considering 659/672 (removed 13) transitions.
// Phase 1: matrix 659 rows 442 cols
[2023-03-21 15:31:24] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-21 15:31:24] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-21 15:31:24] [INFO ] Invariant cache hit.
[2023-03-21 15:31:24] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2023-03-21 15:31:24] [INFO ] Invariant cache hit.
[2023-03-21 15:31:25] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 442/455 places, 659/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1240 ms. Remains : 442/455 places, 659/672 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s373 1), p1:(AND (EQ s57 1) (EQ s163 1) (EQ s291 1) (EQ s386 1)), p2:(AND (EQ s57 1) (EQ s163 1) (EQ s291 1) (EQ s386 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-00 finished in 1703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 672/672 transitions.
Graph (trivial) has 464 edges and 455 vertex of which 72 / 455 are part of one of the 12 SCC in 1 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 274 rules applied. Total rules applied 275 place count 394 transition count 329
Reduce places removed 274 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 282 rules applied. Total rules applied 557 place count 120 transition count 321
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 562 place count 116 transition count 320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 563 place count 115 transition count 320
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 563 place count 115 transition count 305
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 593 place count 100 transition count 305
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 598 place count 95 transition count 299
Iterating global reduction 4 with 5 rules applied. Total rules applied 603 place count 95 transition count 299
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 604 place count 95 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 605 place count 94 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 605 place count 94 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 607 place count 93 transition count 297
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 608 place count 92 transition count 295
Iterating global reduction 6 with 1 rules applied. Total rules applied 609 place count 92 transition count 295
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 610 place count 91 transition count 293
Iterating global reduction 6 with 1 rules applied. Total rules applied 611 place count 91 transition count 293
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 641 place count 76 transition count 278
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 656 place count 61 transition count 138
Iterating global reduction 6 with 15 rules applied. Total rules applied 671 place count 61 transition count 138
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 678 place count 61 transition count 131
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 681 place count 58 transition count 125
Iterating global reduction 7 with 3 rules applied. Total rules applied 684 place count 58 transition count 125
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 687 place count 55 transition count 119
Iterating global reduction 7 with 3 rules applied. Total rules applied 690 place count 55 transition count 119
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -23
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 710 place count 45 transition count 142
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 711 place count 44 transition count 134
Iterating global reduction 7 with 1 rules applied. Total rules applied 712 place count 44 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 713 place count 44 transition count 133
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 717 place count 44 transition count 129
Applied a total of 717 rules in 84 ms. Remains 44 /455 variables (removed 411) and now considering 129/672 (removed 543) transitions.
[2023-03-21 15:31:25] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
// Phase 1: matrix 124 rows 44 cols
[2023-03-21 15:31:25] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-21 15:31:25] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-21 15:31:25] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
[2023-03-21 15:31:25] [INFO ] Invariant cache hit.
[2023-03-21 15:31:26] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-21 15:31:26] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-21 15:31:26] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-21 15:31:26] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
[2023-03-21 15:31:26] [INFO ] Invariant cache hit.
[2023-03-21 15:31:26] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/455 places, 129/672 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 44/455 places, 129/672 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-01 finished in 417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 672/672 transitions.
Graph (trivial) has 454 edges and 455 vertex of which 72 / 455 are part of one of the 12 SCC in 1 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 271 place count 394 transition count 333
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 278 rules applied. Total rules applied 549 place count 124 transition count 325
Reduce places removed 4 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 10 rules applied. Total rules applied 559 place count 120 transition count 319
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 565 place count 114 transition count 319
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 565 place count 114 transition count 304
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 595 place count 99 transition count 304
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 601 place count 93 transition count 297
Iterating global reduction 4 with 6 rules applied. Total rules applied 607 place count 93 transition count 297
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 608 place count 93 transition count 296
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 609 place count 92 transition count 296
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 609 place count 92 transition count 295
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 611 place count 91 transition count 295
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 612 place count 90 transition count 293
Iterating global reduction 6 with 1 rules applied. Total rules applied 613 place count 90 transition count 293
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 614 place count 89 transition count 291
Iterating global reduction 6 with 1 rules applied. Total rules applied 615 place count 89 transition count 291
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 643 place count 75 transition count 277
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 658 place count 60 transition count 137
Iterating global reduction 6 with 15 rules applied. Total rules applied 673 place count 60 transition count 137
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 681 place count 60 transition count 129
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 684 place count 57 transition count 123
Iterating global reduction 7 with 3 rules applied. Total rules applied 687 place count 57 transition count 123
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 690 place count 54 transition count 117
Iterating global reduction 7 with 3 rules applied. Total rules applied 693 place count 54 transition count 117
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -23
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 713 place count 44 transition count 140
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 714 place count 43 transition count 132
Iterating global reduction 7 with 1 rules applied. Total rules applied 715 place count 43 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 716 place count 43 transition count 131
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 720 place count 43 transition count 127
Applied a total of 720 rules in 66 ms. Remains 43 /455 variables (removed 412) and now considering 127/672 (removed 545) transitions.
[2023-03-21 15:31:26] [INFO ] Flow matrix only has 123 transitions (discarded 4 similar events)
// Phase 1: matrix 123 rows 43 cols
[2023-03-21 15:31:26] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-21 15:31:26] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-21 15:31:26] [INFO ] Flow matrix only has 123 transitions (discarded 4 similar events)
[2023-03-21 15:31:26] [INFO ] Invariant cache hit.
[2023-03-21 15:31:26] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 15:31:26] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-21 15:31:26] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 15:31:26] [INFO ] Flow matrix only has 123 transitions (discarded 4 similar events)
[2023-03-21 15:31:26] [INFO ] Invariant cache hit.
[2023-03-21 15:31:26] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/455 places, 127/672 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 303 ms. Remains : 43/455 places, 127/672 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s10 1) (EQ s20 1) (EQ s30 1) (EQ s40 1)), p0:(AND (EQ s10 1) (EQ s20 1) (EQ s30 1) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-02 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(p1))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 672/672 transitions.
Graph (trivial) has 463 edges and 455 vertex of which 72 / 455 are part of one of the 12 SCC in 1 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 273 rules applied. Total rules applied 274 place count 394 transition count 330
Reduce places removed 273 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 281 rules applied. Total rules applied 555 place count 121 transition count 322
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 560 place count 117 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 561 place count 116 transition count 321
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 561 place count 116 transition count 306
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 591 place count 101 transition count 306
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 596 place count 96 transition count 300
Iterating global reduction 4 with 5 rules applied. Total rules applied 601 place count 96 transition count 300
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 602 place count 96 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 603 place count 95 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 603 place count 95 transition count 298
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 605 place count 94 transition count 298
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 606 place count 93 transition count 296
Iterating global reduction 6 with 1 rules applied. Total rules applied 607 place count 93 transition count 296
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 608 place count 92 transition count 294
Iterating global reduction 6 with 1 rules applied. Total rules applied 609 place count 92 transition count 294
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 639 place count 77 transition count 279
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 654 place count 62 transition count 139
Iterating global reduction 6 with 15 rules applied. Total rules applied 669 place count 62 transition count 139
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 677 place count 62 transition count 131
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 680 place count 59 transition count 125
Iterating global reduction 7 with 3 rules applied. Total rules applied 683 place count 59 transition count 125
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 685 place count 57 transition count 121
Iterating global reduction 7 with 2 rules applied. Total rules applied 687 place count 57 transition count 121
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -25
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 707 place count 47 transition count 146
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 717 place count 47 transition count 136
Applied a total of 717 rules in 57 ms. Remains 47 /455 variables (removed 408) and now considering 136/672 (removed 536) transitions.
[2023-03-21 15:31:26] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
// Phase 1: matrix 131 rows 47 cols
[2023-03-21 15:31:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 15:31:26] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-21 15:31:26] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2023-03-21 15:31:26] [INFO ] Invariant cache hit.
[2023-03-21 15:31:26] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-21 15:31:26] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-21 15:31:26] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 15:31:26] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2023-03-21 15:31:26] [INFO ] Invariant cache hit.
[2023-03-21 15:31:27] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/455 places, 136/672 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 396 ms. Remains : 47/455 places, 136/672 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (NEQ s17 1) (NEQ s44 1)), p0:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 353 reset in 252 ms.
Product exploration explored 100000 steps with 259 reset in 142 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 142 steps, including 20 resets, run visited all 3 properties in 5 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 354 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 136/136 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2023-03-21 15:31:28] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2023-03-21 15:31:28] [INFO ] Invariant cache hit.
[2023-03-21 15:31:28] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-21 15:31:28] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2023-03-21 15:31:28] [INFO ] Invariant cache hit.
[2023-03-21 15:31:28] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-21 15:31:28] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-21 15:31:28] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 15:31:28] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2023-03-21 15:31:28] [INFO ] Invariant cache hit.
[2023-03-21 15:31:28] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 47/47 places, 136/136 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 272 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 622 steps, including 87 resets, run visited all 3 properties in 5 ms. (steps per millisecond=124 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 344 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 309 reset in 72 ms.
Stuttering criterion allowed to conclude after 9984 steps with 1418 reset in 45 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-03 finished in 3521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0))&&(X(G(p1))||(p2 U p3))))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 672/672 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 451 transition count 668
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 451 transition count 668
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 447 transition count 664
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 447 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 446 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 446 transition count 663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 445 transition count 662
Applied a total of 20 rules in 61 ms. Remains 445 /455 variables (removed 10) and now considering 662/672 (removed 10) transitions.
// Phase 1: matrix 662 rows 445 cols
[2023-03-21 15:31:30] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-21 15:31:30] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-21 15:31:30] [INFO ] Invariant cache hit.
[2023-03-21 15:31:30] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2023-03-21 15:31:30] [INFO ] Invariant cache hit.
[2023-03-21 15:31:31] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 445/455 places, 662/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1352 ms. Remains : 445/455 places, 662/672 transitions.
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s113 1), p3:(EQ s172 1), p2:(EQ s51 1), p1:(EQ s51 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-05 finished in 1736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p1)))))'
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 672/672 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 450 transition count 667
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 450 transition count 667
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 445 transition count 662
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 445 transition count 662
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 443 transition count 660
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 442 transition count 659
Applied a total of 26 rules in 53 ms. Remains 442 /455 variables (removed 13) and now considering 659/672 (removed 13) transitions.
// Phase 1: matrix 659 rows 442 cols
[2023-03-21 15:31:31] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-21 15:31:32] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-21 15:31:32] [INFO ] Invariant cache hit.
[2023-03-21 15:31:32] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-21 15:31:32] [INFO ] Invariant cache hit.
[2023-03-21 15:31:33] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 442/455 places, 659/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1289 ms. Remains : 442/455 places, 659/672 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s404 1), p1:(EQ s129 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-06 finished in 1450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 672/672 transitions.
Graph (trivial) has 464 edges and 455 vertex of which 72 / 455 are part of one of the 12 SCC in 1 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 274 rules applied. Total rules applied 275 place count 394 transition count 329
Reduce places removed 274 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 282 rules applied. Total rules applied 557 place count 120 transition count 321
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 562 place count 116 transition count 320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 563 place count 115 transition count 320
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 563 place count 115 transition count 305
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 593 place count 100 transition count 305
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 598 place count 95 transition count 299
Iterating global reduction 4 with 5 rules applied. Total rules applied 603 place count 95 transition count 299
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 604 place count 95 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 605 place count 94 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 605 place count 94 transition count 297
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 607 place count 93 transition count 297
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 608 place count 92 transition count 295
Iterating global reduction 6 with 1 rules applied. Total rules applied 609 place count 92 transition count 295
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 610 place count 91 transition count 293
Iterating global reduction 6 with 1 rules applied. Total rules applied 611 place count 91 transition count 293
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 641 place count 76 transition count 278
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 656 place count 61 transition count 138
Iterating global reduction 6 with 15 rules applied. Total rules applied 671 place count 61 transition count 138
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 679 place count 61 transition count 130
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 682 place count 58 transition count 124
Iterating global reduction 7 with 3 rules applied. Total rules applied 685 place count 58 transition count 124
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 688 place count 55 transition count 118
Iterating global reduction 7 with 3 rules applied. Total rules applied 691 place count 55 transition count 118
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -23
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 711 place count 45 transition count 141
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 712 place count 44 transition count 133
Iterating global reduction 7 with 1 rules applied. Total rules applied 713 place count 44 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 714 place count 44 transition count 132
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 718 place count 44 transition count 128
Applied a total of 718 rules in 65 ms. Remains 44 /455 variables (removed 411) and now considering 128/672 (removed 544) transitions.
[2023-03-21 15:31:33] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
// Phase 1: matrix 123 rows 44 cols
[2023-03-21 15:31:33] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 15:31:33] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-21 15:31:33] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
[2023-03-21 15:31:33] [INFO ] Invariant cache hit.
[2023-03-21 15:31:33] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-21 15:31:33] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-21 15:31:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 15:31:33] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
[2023-03-21 15:31:33] [INFO ] Invariant cache hit.
[2023-03-21 15:31:33] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/455 places, 128/672 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 44/455 places, 128/672 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-07 finished in 418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 672/672 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 451 transition count 668
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 451 transition count 668
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 447 transition count 664
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 447 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 446 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 446 transition count 663
Applied a total of 18 rules in 41 ms. Remains 446 /455 variables (removed 9) and now considering 663/672 (removed 9) transitions.
// Phase 1: matrix 663 rows 446 cols
[2023-03-21 15:31:33] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-21 15:31:33] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-21 15:31:33] [INFO ] Invariant cache hit.
[2023-03-21 15:31:34] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2023-03-21 15:31:34] [INFO ] Invariant cache hit.
[2023-03-21 15:31:34] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/455 places, 663/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1223 ms. Remains : 446/455 places, 663/672 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (NEQ s57 1) (NEQ s189 1) (NEQ s273 1) (NEQ s379 1)), p0:(EQ s85 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1366 reset in 201 ms.
Product exploration explored 100000 steps with 1366 reset in 272 ms.
Computed a total of 60 stabilizing places and 64 stable transitions
Computed a total of 60 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 328 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 135 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1070005 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :{}
Probabilistic random walk after 1070005 steps, saw 208874 distinct states, run finished after 3002 ms. (steps per millisecond=356 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 15:31:39] [INFO ] Invariant cache hit.
[2023-03-21 15:31:39] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-21 15:31:39] [INFO ] After 293ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 15:31:39] [INFO ] After 347ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-21 15:31:39] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 82 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 8 factoid took 311 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 446 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 663/663 transitions.
Applied a total of 0 rules in 9 ms. Remains 446 /446 variables (removed 0) and now considering 663/663 (removed 0) transitions.
[2023-03-21 15:31:40] [INFO ] Invariant cache hit.
[2023-03-21 15:31:40] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-21 15:31:40] [INFO ] Invariant cache hit.
[2023-03-21 15:31:40] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2023-03-21 15:31:40] [INFO ] Invariant cache hit.
[2023-03-21 15:31:41] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1222 ms. Remains : 446/446 places, 663/663 transitions.
Computed a total of 60 stabilizing places and 64 stable transitions
Computed a total of 60 stabilizing places and 64 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 135 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1109965 steps, run timeout after 3001 ms. (steps per millisecond=369 ) properties seen :{}
Probabilistic random walk after 1109965 steps, saw 216191 distinct states, run finished after 3004 ms. (steps per millisecond=369 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 15:31:44] [INFO ] Invariant cache hit.
[2023-03-21 15:31:44] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-21 15:31:45] [INFO ] After 305ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 15:31:45] [INFO ] After 358ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-21 15:31:45] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 82 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1360 reset in 123 ms.
Product exploration explored 100000 steps with 1360 reset in 136 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 663/663 transitions.
Graph (trivial) has 453 edges and 446 vertex of which 68 / 446 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Performed 266 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 266 rules applied. Total rules applied 267 place count 390 transition count 599
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 271 place count 390 transition count 595
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 271 place count 390 transition count 599
Deduced a syphon composed of 274 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 279 place count 390 transition count 599
Discarding 228 places :
Symmetric choice reduction at 2 with 228 rule applications. Total rules 507 place count 162 transition count 370
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 2 with 228 rules applied. Total rules applied 735 place count 162 transition count 370
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 736 place count 161 transition count 368
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 737 place count 161 transition count 368
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 768 place count 161 transition count 368
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 812 place count 117 transition count 199
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 2 with 44 rules applied. Total rules applied 856 place count 117 transition count 199
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 864 place count 117 transition count 191
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 879 place count 102 transition count 173
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 3 with 15 rules applied. Total rules applied 894 place count 102 transition count 173
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 897 place count 99 transition count 170
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 900 place count 99 transition count 170
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 909 place count 99 transition count 225
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 920 place count 88 transition count 203
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 931 place count 88 transition count 203
Deduced a syphon composed of 40 places in 1 ms
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 943 place count 88 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 944 place count 88 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 945 place count 87 transition count 202
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 946 place count 87 transition count 202
Deduced a syphon composed of 40 places in 0 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 950 place count 87 transition count 198
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 950 rules in 89 ms. Remains 87 /446 variables (removed 359) and now considering 198/663 (removed 465) transitions.
[2023-03-21 15:31:46] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 15:31:46] [INFO ] Flow matrix only has 193 transitions (discarded 5 similar events)
// Phase 1: matrix 193 rows 87 cols
[2023-03-21 15:31:46] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 15:31:46] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/446 places, 198/663 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 87/446 places, 198/663 transitions.
Built C files in :
/tmp/ltsmin1377150847809123829
[2023-03-21 15:31:46] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1377150847809123829
Running compilation step : cd /tmp/ltsmin1377150847809123829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1790 ms.
Running link step : cd /tmp/ltsmin1377150847809123829;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 211 ms.
Running LTSmin : cd /tmp/ltsmin1377150847809123829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16504772930950197541.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 663/663 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 442 transition count 659
Applied a total of 8 rules in 94 ms. Remains 442 /446 variables (removed 4) and now considering 659/663 (removed 4) transitions.
// Phase 1: matrix 659 rows 442 cols
[2023-03-21 15:32:01] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-21 15:32:01] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-21 15:32:01] [INFO ] Invariant cache hit.
[2023-03-21 15:32:02] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2023-03-21 15:32:02] [INFO ] Invariant cache hit.
[2023-03-21 15:32:02] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 442/446 places, 659/663 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1360 ms. Remains : 442/446 places, 659/663 transitions.
Built C files in :
/tmp/ltsmin6637173965863262123
[2023-03-21 15:32:02] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6637173965863262123
Running compilation step : cd /tmp/ltsmin6637173965863262123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1698 ms.
Running link step : cd /tmp/ltsmin6637173965863262123;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6637173965863262123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8212534751754678985.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-21 15:32:18] [INFO ] Flatten gal took : 54 ms
[2023-03-21 15:32:18] [INFO ] Flatten gal took : 53 ms
[2023-03-21 15:32:18] [INFO ] Time to serialize gal into /tmp/LTL4029699419094687011.gal : 9 ms
[2023-03-21 15:32:18] [INFO ] Time to serialize properties into /tmp/LTL2967540388538197582.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4029699419094687011.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10525781179767223814.hoa' '-atoms' '/tmp/LTL2967540388538197582.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2967540388538197582.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10525781179767223814.hoa
Detected timeout of ITS tools.
[2023-03-21 15:32:33] [INFO ] Flatten gal took : 43 ms
[2023-03-21 15:32:33] [INFO ] Flatten gal took : 35 ms
[2023-03-21 15:32:33] [INFO ] Time to serialize gal into /tmp/LTL752727115552464272.gal : 5 ms
[2023-03-21 15:32:33] [INFO ] Time to serialize properties into /tmp/LTL13188997896553955371.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL752727115552464272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13188997896553955371.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((F("(p106==0)"))&&(G("(((p74!=1)||(p234!=1))||((p344!=1)||(p479!=1)))")))))
Formula 0 simplified : X(G!"(p106==0)" | F!"(((p74!=1)||(p234!=1))||((p344!=1)||(p479!=1)))")
Detected timeout of ITS tools.
[2023-03-21 15:32:48] [INFO ] Flatten gal took : 29 ms
[2023-03-21 15:32:48] [INFO ] Applying decomposition
[2023-03-21 15:32:48] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3150507449570153771.txt' '-o' '/tmp/graph3150507449570153771.bin' '-w' '/tmp/graph3150507449570153771.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3150507449570153771.bin' '-l' '-1' '-v' '-w' '/tmp/graph3150507449570153771.weights' '-q' '0' '-e' '0.001'
[2023-03-21 15:32:48] [INFO ] Decomposing Gal with order
[2023-03-21 15:32:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 15:32:48] [INFO ] Removed a total of 793 redundant transitions.
[2023-03-21 15:32:48] [INFO ] Flatten gal took : 143 ms
[2023-03-21 15:32:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 15 ms.
[2023-03-21 15:32:49] [INFO ] Time to serialize gal into /tmp/LTL18356220795653396736.gal : 18 ms
[2023-03-21 15:32:49] [INFO ] Time to serialize properties into /tmp/LTL2922573869158490832.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18356220795653396736.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2922573869158490832.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F("(i6.i0.u33.p106==0)"))&&(G("(((i3.i1.u22.p74!=1)||(i3.i0.u60.p234!=1))||((i3.i1.u108.p344!=1)||(i3.i1.u153.p479!=1)))")))))
Formula 0 simplified : X(G!"(i6.i0.u33.p106==0)" | F!"(((i3.i1.u22.p74!=1)||(i3.i0.u60.p234!=1))||((i3.i1.u108.p344!=1)||(i3.i1.u153.p479!=1)))")
Reverse transition relation is NOT exact ! Due to transitions t60, t141, t143, t160, t205, t239, t241, t258, t304, t339, t342, t358, t369, t406, t441, t464...475
Computing Next relation with stutter on 11256 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12220219001940865418
[2023-03-21 15:33:04] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12220219001940865418
Running compilation step : cd /tmp/ltsmin12220219001940865418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1608 ms.
Running link step : cd /tmp/ltsmin12220219001940865418;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12220219001940865418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property StigmergyElection-PT-04b-LTLFireability-10 finished in 105427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))))))'
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 672/672 transitions.
Graph (trivial) has 461 edges and 455 vertex of which 70 / 455 are part of one of the 12 SCC in 2 ms
Free SCC test removed 58 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 276 place count 396 transition count 331
Reduce places removed 275 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 283 rules applied. Total rules applied 559 place count 121 transition count 323
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 564 place count 117 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 565 place count 116 transition count 322
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 565 place count 116 transition count 307
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 595 place count 101 transition count 307
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 599 place count 97 transition count 303
Iterating global reduction 4 with 4 rules applied. Total rules applied 603 place count 97 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 603 place count 97 transition count 302
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 605 place count 96 transition count 302
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 4 with 32 rules applied. Total rules applied 637 place count 80 transition count 286
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 652 place count 65 transition count 146
Iterating global reduction 4 with 15 rules applied. Total rules applied 667 place count 65 transition count 146
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 675 place count 65 transition count 138
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 678 place count 62 transition count 132
Iterating global reduction 5 with 3 rules applied. Total rules applied 681 place count 62 transition count 132
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 684 place count 59 transition count 126
Iterating global reduction 5 with 3 rules applied. Total rules applied 687 place count 59 transition count 126
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -17
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 707 place count 49 transition count 143
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 708 place count 48 transition count 133
Iterating global reduction 5 with 1 rules applied. Total rules applied 709 place count 48 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 710 place count 48 transition count 132
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 715 place count 48 transition count 127
Applied a total of 715 rules in 52 ms. Remains 48 /455 variables (removed 407) and now considering 127/672 (removed 545) transitions.
[2023-03-21 15:33:19] [INFO ] Flow matrix only has 121 transitions (discarded 6 similar events)
// Phase 1: matrix 121 rows 48 cols
[2023-03-21 15:33:19] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 15:33:19] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-21 15:33:19] [INFO ] Flow matrix only has 121 transitions (discarded 6 similar events)
[2023-03-21 15:33:19] [INFO ] Invariant cache hit.
[2023-03-21 15:33:19] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-21 15:33:19] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-21 15:33:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 15:33:19] [INFO ] Flow matrix only has 121 transitions (discarded 6 similar events)
[2023-03-21 15:33:19] [INFO ] Invariant cache hit.
[2023-03-21 15:33:19] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/455 places, 127/672 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 408 ms. Remains : 48/455 places, 127/672 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s25 1), p1:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 56 reset in 229 ms.
Product exploration explored 100000 steps with 42 reset in 269 ms.
Computed a total of 3 stabilizing places and 11 stable transitions
Computed a total of 3 stabilizing places and 11 stable transitions
Detected a total of 3/48 stabilizing places and 11/127 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1161 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 191 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 80153 steps, run visited all 1 properties in 107 ms. (steps per millisecond=749 )
Probabilistic random walk after 80153 steps, saw 17030 distinct states, run finished after 107 ms. (steps per millisecond=749 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-21 15:33:20] [INFO ] Flow matrix only has 121 transitions (discarded 6 similar events)
[2023-03-21 15:33:20] [INFO ] Invariant cache hit.
[2023-03-21 15:33:21] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-21 15:33:21] [INFO ] Flow matrix only has 121 transitions (discarded 6 similar events)
[2023-03-21 15:33:21] [INFO ] Invariant cache hit.
[2023-03-21 15:33:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-21 15:33:21] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-21 15:33:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 15:33:21] [INFO ] Flow matrix only has 121 transitions (discarded 6 similar events)
[2023-03-21 15:33:21] [INFO ] Invariant cache hit.
[2023-03-21 15:33:21] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 393 ms. Remains : 48/48 places, 127/127 transitions.
Computed a total of 3 stabilizing places and 11 stable transitions
Computed a total of 3 stabilizing places and 11 stable transitions
Detected a total of 3/48 stabilizing places and 11/127 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1159 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 189 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 80153 steps, run visited all 1 properties in 103 ms. (steps per millisecond=778 )
Probabilistic random walk after 80153 steps, saw 17030 distinct states, run finished after 103 ms. (steps per millisecond=778 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 460 reset in 51 ms.
Product exploration explored 100000 steps with 489 reset in 55 ms.
Built C files in :
/tmp/ltsmin8252812995162555659
[2023-03-21 15:33:22] [INFO ] Computing symmetric may disable matrix : 127 transitions.
[2023-03-21 15:33:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 15:33:22] [INFO ] Computing symmetric may enable matrix : 127 transitions.
[2023-03-21 15:33:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 15:33:22] [INFO ] Computing Do-Not-Accords matrix : 127 transitions.
[2023-03-21 15:33:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 15:33:22] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8252812995162555659
Running compilation step : cd /tmp/ltsmin8252812995162555659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 399 ms.
Running link step : cd /tmp/ltsmin8252812995162555659;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8252812995162555659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6269904633323160105.hoa' '--buchi-type=spotba'
LTSmin run took 232 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-04b-LTLFireability-11 finished in 3765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 672/672 transitions.
Graph (trivial) has 462 edges and 455 vertex of which 72 / 455 are part of one of the 12 SCC in 1 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 272 rules applied. Total rules applied 273 place count 394 transition count 331
Reduce places removed 272 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 280 rules applied. Total rules applied 553 place count 122 transition count 323
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 558 place count 118 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 559 place count 117 transition count 322
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 559 place count 117 transition count 307
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 589 place count 102 transition count 307
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 594 place count 97 transition count 301
Iterating global reduction 4 with 5 rules applied. Total rules applied 599 place count 97 transition count 301
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 600 place count 97 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 601 place count 96 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 601 place count 96 transition count 299
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 603 place count 95 transition count 299
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 604 place count 94 transition count 297
Iterating global reduction 6 with 1 rules applied. Total rules applied 605 place count 94 transition count 297
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 606 place count 93 transition count 295
Iterating global reduction 6 with 1 rules applied. Total rules applied 607 place count 93 transition count 295
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 637 place count 78 transition count 280
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 651 place count 64 transition count 142
Iterating global reduction 6 with 14 rules applied. Total rules applied 665 place count 64 transition count 142
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 673 place count 64 transition count 134
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 675 place count 62 transition count 130
Iterating global reduction 7 with 2 rules applied. Total rules applied 677 place count 62 transition count 130
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 679 place count 60 transition count 126
Iterating global reduction 7 with 2 rules applied. Total rules applied 681 place count 60 transition count 126
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 703 place count 49 transition count 149
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 704 place count 48 transition count 139
Iterating global reduction 7 with 1 rules applied. Total rules applied 705 place count 48 transition count 139
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 709 place count 48 transition count 135
Applied a total of 709 rules in 46 ms. Remains 48 /455 variables (removed 407) and now considering 135/672 (removed 537) transitions.
[2023-03-21 15:33:22] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 48 cols
[2023-03-21 15:33:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 15:33:23] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-21 15:33:23] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2023-03-21 15:33:23] [INFO ] Invariant cache hit.
[2023-03-21 15:33:23] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-21 15:33:23] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2023-03-21 15:33:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 15:33:23] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2023-03-21 15:33:23] [INFO ] Invariant cache hit.
[2023-03-21 15:33:23] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/455 places, 135/672 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 611 ms. Remains : 48/455 places, 135/672 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s35 1) (EQ s46 1)), p1:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-12 finished in 745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||X(F(p2)))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 672/672 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 450 transition count 667
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 450 transition count 667
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 445 transition count 662
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 445 transition count 662
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 443 transition count 660
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 442 transition count 659
Applied a total of 26 rules in 48 ms. Remains 442 /455 variables (removed 13) and now considering 659/672 (removed 13) transitions.
// Phase 1: matrix 659 rows 442 cols
[2023-03-21 15:33:23] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-21 15:33:23] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-21 15:33:23] [INFO ] Invariant cache hit.
[2023-03-21 15:33:24] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2023-03-21 15:33:24] [INFO ] Invariant cache hit.
[2023-03-21 15:33:25] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 442/455 places, 659/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1392 ms. Remains : 442/455 places, 659/672 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(EQ s416 1), p0:(EQ s296 1), p1:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-13 finished in 1559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(X(((!p0 U X(!(p0 U p1)))||p0))) U p2))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 672/672 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 451 transition count 668
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 451 transition count 668
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 447 transition count 664
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 447 transition count 664
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 445 transition count 662
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 444 transition count 661
Applied a total of 22 rules in 50 ms. Remains 444 /455 variables (removed 11) and now considering 661/672 (removed 11) transitions.
// Phase 1: matrix 661 rows 444 cols
[2023-03-21 15:33:25] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-21 15:33:25] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-21 15:33:25] [INFO ] Invariant cache hit.
[2023-03-21 15:33:25] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2023-03-21 15:33:25] [INFO ] Invariant cache hit.
[2023-03-21 15:33:26] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 444/455 places, 661/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1193 ms. Remains : 444/455 places, 661/672 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) p0), true, (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(OR (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s51 1), p0:(AND (EQ s58 1) (EQ s432 1)), p1:(EQ s400 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-14 finished in 1447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
[2023-03-21 15:33:26] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6340406208057815109
[2023-03-21 15:33:26] [INFO ] Computing symmetric may disable matrix : 672 transitions.
[2023-03-21 15:33:26] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 15:33:26] [INFO ] Computing symmetric may enable matrix : 672 transitions.
[2023-03-21 15:33:26] [INFO ] Applying decomposition
[2023-03-21 15:33:26] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 15:33:26] [INFO ] Flatten gal took : 40 ms
[2023-03-21 15:33:27] [INFO ] Computing Do-Not-Accords matrix : 672 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7474622834938061168.txt' '-o' '/tmp/graph7474622834938061168.bin' '-w' '/tmp/graph7474622834938061168.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7474622834938061168.bin' '-l' '-1' '-v' '-w' '/tmp/graph7474622834938061168.weights' '-q' '0' '-e' '0.001'
[2023-03-21 15:33:27] [INFO ] Decomposing Gal with order
[2023-03-21 15:33:27] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 15:33:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 15:33:27] [INFO ] Built C files in 200ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6340406208057815109
Running compilation step : cd /tmp/ltsmin6340406208057815109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-21 15:33:27] [INFO ] Removed a total of 800 redundant transitions.
[2023-03-21 15:33:27] [INFO ] Flatten gal took : 73 ms
[2023-03-21 15:33:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 10 ms.
[2023-03-21 15:33:27] [INFO ] Time to serialize gal into /tmp/LTLFireability18384095312314490249.gal : 9 ms
[2023-03-21 15:33:27] [INFO ] Time to serialize properties into /tmp/LTLFireability981743585115760040.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18384095312314490249.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability981743585115760040.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F("(i6.i1.u40.p106==0)"))&&(G("(((i0.u27.p74!=1)||(i0.u69.p234!=1))||((i0.u119.p344!=1)||(i0.u163.p479!=1)))")))))
Formula 0 simplified : X(G!"(i6.i1.u40.p106==0)" | F!"(((i0.u27.p74!=1)||(i0.u69.p234!=1))||((i0.u119.p344!=1)||(i0.u163.p479!=1)))")
Compilation finished in 2583 ms.
Running link step : cd /tmp/ltsmin6340406208057815109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin6340406208057815109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t60, t106, t107, t141, t143, t160, t205, t239, t241, t258, t303, t304, t341, t342, t358, t369...435
Computing Next relation with stutter on 11256 deadlock states
115 unique states visited
115 strongly connected components in search stack
116 transitions explored
115 items max in DFS search stack
6220 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,62.3218,1705572,1,0,1.72555e+06,904,7540,1.63701e+07,222,4026,3082284
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA StigmergyElection-PT-04b-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 302804 ms.
BK_STOP 1679412976995
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-04b"
export BK_EXAMINATION="LTLFireability"
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-5348"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r453-smll-167912645700596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-04b.tgz
mv StigmergyElection-PT-04b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;