Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r399-tall-171690529700131.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is StigmergyCommit-PT-04b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529700131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 627K May 18 16:43 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 StigmergyCommit-PT-04b-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-04b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716987708098

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 13:01:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 13:01:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:01:49] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-05-29 13:01:49] [INFO ] Transformed 1534 places.
[2024-05-29 13:01:49] [INFO ] Transformed 2136 transitions.
[2024-05-29 13:01:49] [INFO ] Found NUPN structural information;
[2024-05-29 13:01:49] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-04b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-04b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 1534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 122 place count 1412 transition count 2014
Iterating global reduction 0 with 122 rules applied. Total rules applied 244 place count 1412 transition count 2014
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 318 place count 1338 transition count 1940
Iterating global reduction 0 with 74 rules applied. Total rules applied 392 place count 1338 transition count 1940
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 434 place count 1296 transition count 1898
Iterating global reduction 0 with 42 rules applied. Total rules applied 476 place count 1296 transition count 1898
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 513 place count 1259 transition count 1861
Iterating global reduction 0 with 37 rules applied. Total rules applied 550 place count 1259 transition count 1861
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 581 place count 1228 transition count 1830
Iterating global reduction 0 with 31 rules applied. Total rules applied 612 place count 1228 transition count 1830
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 642 place count 1198 transition count 1800
Iterating global reduction 0 with 30 rules applied. Total rules applied 672 place count 1198 transition count 1800
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 701 place count 1169 transition count 1771
Iterating global reduction 0 with 29 rules applied. Total rules applied 730 place count 1169 transition count 1771
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 759 place count 1140 transition count 1742
Iterating global reduction 0 with 29 rules applied. Total rules applied 788 place count 1140 transition count 1742
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 811 place count 1117 transition count 1719
Iterating global reduction 0 with 23 rules applied. Total rules applied 834 place count 1117 transition count 1719
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 852 place count 1099 transition count 1701
Iterating global reduction 0 with 18 rules applied. Total rules applied 870 place count 1099 transition count 1701
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 873 place count 1099 transition count 1698
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 879 place count 1093 transition count 1692
Iterating global reduction 1 with 6 rules applied. Total rules applied 885 place count 1093 transition count 1692
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 891 place count 1087 transition count 1686
Iterating global reduction 1 with 6 rules applied. Total rules applied 897 place count 1087 transition count 1686
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 900 place count 1084 transition count 1683
Iterating global reduction 1 with 3 rules applied. Total rules applied 903 place count 1084 transition count 1683
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 906 place count 1081 transition count 1680
Iterating global reduction 1 with 3 rules applied. Total rules applied 909 place count 1081 transition count 1680
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 912 place count 1078 transition count 1677
Iterating global reduction 1 with 3 rules applied. Total rules applied 915 place count 1078 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 916 place count 1077 transition count 1676
Iterating global reduction 1 with 1 rules applied. Total rules applied 917 place count 1077 transition count 1676
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 918 place count 1076 transition count 1675
Iterating global reduction 1 with 1 rules applied. Total rules applied 919 place count 1076 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 920 place count 1075 transition count 1674
Iterating global reduction 1 with 1 rules applied. Total rules applied 921 place count 1075 transition count 1674
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 922 place count 1074 transition count 1673
Iterating global reduction 1 with 1 rules applied. Total rules applied 923 place count 1074 transition count 1673
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 924 place count 1073 transition count 1672
Iterating global reduction 1 with 1 rules applied. Total rules applied 925 place count 1073 transition count 1672
Applied a total of 925 rules in 1315 ms. Remains 1073 /1534 variables (removed 461) and now considering 1672/2136 (removed 464) transitions.
// Phase 1: matrix 1672 rows 1073 cols
[2024-05-29 13:01:51] [INFO ] Computed 6 invariants in 44 ms
[2024-05-29 13:01:51] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-05-29 13:01:51] [INFO ] Invariant cache hit.
[2024-05-29 13:01:52] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
Running 1671 sub problems to find dead transitions.
[2024-05-29 13:01:52] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1072 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1671 unsolved
SMT process timed out in 32654ms, After SMT, problems are : Problem set: 0 solved, 1671 unsolved
Search for dead transitions found 0 dead transitions in 32699ms
Starting structural reductions in LTL mode, iteration 1 : 1073/1534 places, 1672/2136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35501 ms. Remains : 1073/1534 places, 1672/2136 transitions.
Support contains 28 out of 1073 places after structural reductions.
[2024-05-29 13:02:25] [INFO ] Flatten gal took : 165 ms
[2024-05-29 13:02:25] [INFO ] Flatten gal took : 106 ms
[2024-05-29 13:02:25] [INFO ] Input system was already deterministic with 1672 transitions.
Support contains 26 out of 1073 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (420 resets) in 1756 ms. (22 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40003 steps (78 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (77 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (78 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (78 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (76 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (77 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (75 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (77 resets) in 190 ms. (209 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (79 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (77 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
[2024-05-29 13:02:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1041/1059 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1059 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 14/1073 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1672/2745 variables, 1073/1079 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2745 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/2745 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2745/2745 variables, and 1079 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1550 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1073/1073 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 1041/1059 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-29 13:02:29] [INFO ] Deduced a trap composed of 324 places in 510 ms of which 59 ms to minimize.
[2024-05-29 13:02:29] [INFO ] Deduced a trap composed of 326 places in 505 ms of which 9 ms to minimize.
[2024-05-29 13:02:30] [INFO ] Deduced a trap composed of 299 places in 415 ms of which 6 ms to minimize.
[2024-05-29 13:02:30] [INFO ] Deduced a trap composed of 326 places in 352 ms of which 5 ms to minimize.
[2024-05-29 13:02:31] [INFO ] Deduced a trap composed of 323 places in 315 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1059 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1059 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 14/1073 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1073 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1672/2745 variables, 1073/1084 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2745 variables, 9/1093 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-29 13:02:32] [INFO ] Deduced a trap composed of 302 places in 316 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2745 variables, 1/1094 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2745/2745 variables, and 1094 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1073/1073 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 6/6 constraints]
After SMT, in 6610ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 1073 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1073/1073 places, 1672/1672 transitions.
Graph (trivial) has 1042 edges and 1073 vertex of which 85 / 1073 are part of one of the 15 SCC in 7 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1695 edges and 1003 vertex of which 997 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 724 transitions
Trivial Post-agglo rules discarded 724 transitions
Performed 724 trivial Post agglomeration. Transition count delta: 724
Iterating post reduction 0 with 729 rules applied. Total rules applied 731 place count 997 transition count 847
Reduce places removed 724 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 740 rules applied. Total rules applied 1471 place count 273 transition count 831
Reduce places removed 6 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 12 rules applied. Total rules applied 1483 place count 267 transition count 825
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1489 place count 261 transition count 825
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 1489 place count 261 transition count 760
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 1619 place count 196 transition count 760
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1620 place count 196 transition count 759
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1622 place count 194 transition count 757
Iterating global reduction 5 with 2 rules applied. Total rules applied 1624 place count 194 transition count 757
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1625 place count 194 transition count 756
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1626 place count 193 transition count 755
Iterating global reduction 6 with 1 rules applied. Total rules applied 1627 place count 193 transition count 755
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 1699 place count 157 transition count 719
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1709 place count 157 transition count 709
Discarding 29 places :
Symmetric choice reduction at 7 with 29 rule applications. Total rules 1738 place count 128 transition count 259
Iterating global reduction 7 with 29 rules applied. Total rules applied 1767 place count 128 transition count 259
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1779 place count 128 transition count 247
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1793 place count 114 transition count 233
Iterating global reduction 8 with 14 rules applied. Total rules applied 1807 place count 114 transition count 233
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1816 place count 105 transition count 224
Iterating global reduction 8 with 9 rules applied. Total rules applied 1825 place count 105 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1829 place count 105 transition count 220
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1839 place count 100 transition count 215
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1845 place count 97 transition count 230
Free-agglomeration rule applied 33 times.
Iterating global reduction 9 with 33 rules applied. Total rules applied 1878 place count 97 transition count 197
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 9 with 33 rules applied. Total rules applied 1911 place count 64 transition count 197
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1916 place count 59 transition count 192
Iterating global reduction 10 with 5 rules applied. Total rules applied 1921 place count 59 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 10 with 44 rules applied. Total rules applied 1965 place count 59 transition count 148
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1966 place count 59 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1967 place count 58 transition count 147
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 1975 place count 58 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1980 place count 58 transition count 142
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1981 place count 58 transition count 142
Applied a total of 1981 rules in 213 ms. Remains 58 /1073 variables (removed 1015) and now considering 142/1672 (removed 1530) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 58/1073 places, 142/1672 transitions.
RANDOM walk for 20891 steps (637 resets) in 711 ms. (29 steps per ms) remains 0/9 properties
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 209 stabilizing places and 219 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1073 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1073/1073 places, 1672/1672 transitions.
Graph (trivial) has 1062 edges and 1073 vertex of which 85 / 1073 are part of one of the 15 SCC in 2 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 737 transitions
Trivial Post-agglo rules discarded 737 transitions
Performed 737 trivial Post agglomeration. Transition count delta: 737
Iterating post reduction 0 with 737 rules applied. Total rules applied 738 place count 1002 transition count 854
Reduce places removed 737 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 755 rules applied. Total rules applied 1493 place count 265 transition count 836
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 1502 place count 258 transition count 834
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1504 place count 256 transition count 834
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 1504 place count 256 transition count 777
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1618 place count 199 transition count 777
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1628 place count 189 transition count 767
Iterating global reduction 4 with 10 rules applied. Total rules applied 1638 place count 189 transition count 767
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1640 place count 189 transition count 765
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1644 place count 185 transition count 761
Iterating global reduction 5 with 4 rules applied. Total rules applied 1648 place count 185 transition count 761
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1650 place count 183 transition count 759
Iterating global reduction 5 with 2 rules applied. Total rules applied 1652 place count 183 transition count 759
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1654 place count 181 transition count 757
Iterating global reduction 5 with 2 rules applied. Total rules applied 1656 place count 181 transition count 757
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1657 place count 181 transition count 756
Performed 39 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 1735 place count 142 transition count 715
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 1763 place count 114 transition count 270
Iterating global reduction 6 with 28 rules applied. Total rules applied 1791 place count 114 transition count 270
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1803 place count 114 transition count 258
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1818 place count 99 transition count 238
Iterating global reduction 7 with 15 rules applied. Total rules applied 1833 place count 99 transition count 238
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1848 place count 84 transition count 218
Iterating global reduction 7 with 15 rules applied. Total rules applied 1863 place count 84 transition count 218
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1868 place count 84 transition count 213
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1886 place count 75 transition count 227
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1887 place count 74 transition count 217
Iterating global reduction 8 with 1 rules applied. Total rules applied 1888 place count 74 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1889 place count 74 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1894 place count 74 transition count 211
Applied a total of 1894 rules in 136 ms. Remains 74 /1073 variables (removed 999) and now considering 211/1672 (removed 1461) transitions.
[2024-05-29 13:02:34] [INFO ] Flow matrix only has 205 transitions (discarded 6 similar events)
// Phase 1: matrix 205 rows 74 cols
[2024-05-29 13:02:34] [INFO ] Computed 2 invariants in 7 ms
[2024-05-29 13:02:34] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-29 13:02:34] [INFO ] Flow matrix only has 205 transitions (discarded 6 similar events)
[2024-05-29 13:02:34] [INFO ] Invariant cache hit.
[2024-05-29 13:02:34] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 13:02:34] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-29 13:02:34] [INFO ] Redundant transitions in 8 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-29 13:02:34] [INFO ] Flow matrix only has 205 transitions (discarded 6 similar events)
[2024-05-29 13:02:34] [INFO ] Invariant cache hit.
[2024-05-29 13:02:34] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-29 13:02:35] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:02:35] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-29 13:02:35] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:02:35] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:02:35] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:02:35] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:02:35] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:02:35] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:02:36] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:02:36] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:02:36] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:02:36] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:02:36] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:02:36] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:02:36] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:02:36] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:02:36] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:02:36] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:02:36] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:02:36] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-29 13:02:37] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:02:37] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:02:37] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:02:37] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:02:37] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:02:37] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:02:37] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:02:37] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-29 13:02:38] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 3 ms to minimize.
[2024-05-29 13:02:38] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-29 13:02:38] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:02:38] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-29 13:02:39] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:02:39] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:02:39] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 204/278 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 30/141 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-29 13:02:41] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:02:41] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 13 (OVERLAPS) 1/279 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 15 (OVERLAPS) 0/279 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 144 constraints, problems are : Problem set: 0 solved, 186 unsolved in 11597 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 204/278 variables, 74/113 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 186/329 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 1/279 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-29 13:02:56] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:02:56] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-29 13:03:05] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-29 13:03:05] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/279 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-29 13:03:15] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/279 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 279/279 variables, and 335 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 42/42 constraints]
After SMT, in 41827ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 41829ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/1073 places, 211/1672 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42163 ms. Remains : 74/1073 places, 211/1672 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLCardinality-03
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-04b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLCardinality-03 finished in 42493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 1073 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1073/1073 places, 1672/1672 transitions.
Graph (trivial) has 1066 edges and 1073 vertex of which 85 / 1073 are part of one of the 15 SCC in 2 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 742 transitions
Trivial Post-agglo rules discarded 742 transitions
Performed 742 trivial Post agglomeration. Transition count delta: 742
Iterating post reduction 0 with 742 rules applied. Total rules applied 743 place count 1002 transition count 849
Reduce places removed 742 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 758 rules applied. Total rules applied 1501 place count 260 transition count 833
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 1508 place count 254 transition count 832
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1509 place count 253 transition count 832
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 1509 place count 253 transition count 775
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1623 place count 196 transition count 775
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1635 place count 184 transition count 763
Iterating global reduction 4 with 12 rules applied. Total rules applied 1647 place count 184 transition count 763
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1649 place count 184 transition count 761
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1655 place count 178 transition count 755
Iterating global reduction 5 with 6 rules applied. Total rules applied 1661 place count 178 transition count 755
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1662 place count 178 transition count 754
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1663 place count 177 transition count 753
Iterating global reduction 6 with 1 rules applied. Total rules applied 1664 place count 177 transition count 753
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1665 place count 176 transition count 752
Iterating global reduction 6 with 1 rules applied. Total rules applied 1666 place count 176 transition count 752
Performed 38 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 1742 place count 138 transition count 712
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 1770 place count 110 transition count 267
Iterating global reduction 6 with 28 rules applied. Total rules applied 1798 place count 110 transition count 267
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1812 place count 110 transition count 253
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1827 place count 95 transition count 233
Iterating global reduction 7 with 15 rules applied. Total rules applied 1842 place count 95 transition count 233
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1857 place count 80 transition count 213
Iterating global reduction 7 with 15 rules applied. Total rules applied 1872 place count 80 transition count 213
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1878 place count 80 transition count 207
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1896 place count 71 transition count 214
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1897 place count 70 transition count 204
Iterating global reduction 8 with 1 rules applied. Total rules applied 1898 place count 70 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1899 place count 70 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1904 place count 70 transition count 198
Applied a total of 1904 rules in 95 ms. Remains 70 /1073 variables (removed 1003) and now considering 198/1672 (removed 1474) transitions.
[2024-05-29 13:03:16] [INFO ] Flow matrix only has 192 transitions (discarded 6 similar events)
// Phase 1: matrix 192 rows 70 cols
[2024-05-29 13:03:16] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 13:03:16] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 13:03:16] [INFO ] Flow matrix only has 192 transitions (discarded 6 similar events)
[2024-05-29 13:03:16] [INFO ] Invariant cache hit.
[2024-05-29 13:03:16] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 13:03:16] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-29 13:03:16] [INFO ] Redundant transitions in 6 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-29 13:03:16] [INFO ] Flow matrix only has 192 transitions (discarded 6 similar events)
[2024-05-29 13:03:16] [INFO ] Invariant cache hit.
[2024-05-29 13:03:16] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 13:03:17] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:03:17] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:03:17] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:03:17] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:03:17] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:03:18] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:03:19] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 13:03:19] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:03:19] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 13:03:20] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:03:20] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:03:20] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:03:20] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:03:20] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:03:20] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:03:20] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:03:20] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 191/261 variables, 70/102 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 30/132 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 1/262 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 0/262 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 133 constraints, problems are : Problem set: 0 solved, 181 unsolved in 8284 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 13:03:26] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 13:03:26] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:03:26] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 191/261 variables, 70/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 30/135 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 181/316 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 1/262 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 13:03:33] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/262 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 13:03:40] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/262 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 13:03:44] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/262 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/262 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-29 13:03:51] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:03:51] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:03:51] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/262 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/262 variables, and 323 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 39/39 constraints]
After SMT, in 38462ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 38464ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/1073 places, 198/1672 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38746 ms. Remains : 70/1073 places, 198/1672 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLCardinality-04
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-04b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLCardinality-04 finished in 38803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1073 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1073/1073 places, 1672/1672 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1063 transition count 1662
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1063 transition count 1662
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 1054 transition count 1653
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 1054 transition count 1653
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 1054 transition count 1652
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 1046 transition count 1644
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 1046 transition count 1644
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 1038 transition count 1636
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 1038 transition count 1636
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 77 place count 1032 transition count 1630
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 1032 transition count 1630
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 1032 transition count 1629
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 1027 transition count 1624
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 1027 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 99 place count 1022 transition count 1619
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 1022 transition count 1619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 1022 transition count 1617
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 109 place count 1019 transition count 1614
Iterating global reduction 3 with 3 rules applied. Total rules applied 112 place count 1019 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 1017 transition count 1612
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 1017 transition count 1612
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 1015 transition count 1610
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 1015 transition count 1610
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 1013 transition count 1608
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 1013 transition count 1608
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 1011 transition count 1606
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 1011 transition count 1606
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 1009 transition count 1604
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 1009 transition count 1604
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 134 place count 1007 transition count 1602
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 1007 transition count 1602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 137 place count 1007 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 1006 transition count 1600
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 1006 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 1005 transition count 1599
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 1005 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 1004 transition count 1598
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 1004 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 144 place count 1003 transition count 1597
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 1003 transition count 1597
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 1002 transition count 1596
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 1002 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 1001 transition count 1595
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 1001 transition count 1595
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 150 place count 1000 transition count 1594
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 1000 transition count 1594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 152 place count 1000 transition count 1593
Applied a total of 152 rules in 652 ms. Remains 1000 /1073 variables (removed 73) and now considering 1593/1672 (removed 79) transitions.
// Phase 1: matrix 1593 rows 1000 cols
[2024-05-29 13:03:56] [INFO ] Computed 6 invariants in 23 ms
[2024-05-29 13:03:56] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-29 13:03:56] [INFO ] Invariant cache hit.
[2024-05-29 13:03:57] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
Running 1592 sub problems to find dead transitions.
[2024-05-29 13:03:57] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
SMT process timed out in 32262ms, After SMT, problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 32280ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1073 places, 1593/1672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33945 ms. Remains : 1000/1073 places, 1593/1672 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 389 ms.
Product exploration explored 100000 steps with 50000 reset in 342 ms.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-04b-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-04b-LTLCardinality-06 finished in 34839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(!p0)) U !p1)))'
Support contains 4 out of 1073 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1073/1073 places, 1672/1672 transitions.
Graph (trivial) has 1062 edges and 1073 vertex of which 85 / 1073 are part of one of the 15 SCC in 2 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 735 transitions
Trivial Post-agglo rules discarded 735 transitions
Performed 735 trivial Post agglomeration. Transition count delta: 735
Iterating post reduction 0 with 735 rules applied. Total rules applied 736 place count 1002 transition count 856
Reduce places removed 735 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 753 rules applied. Total rules applied 1489 place count 267 transition count 838
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 1499 place count 260 transition count 835
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1502 place count 257 transition count 835
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 1502 place count 257 transition count 778
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1616 place count 200 transition count 778
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1627 place count 189 transition count 767
Iterating global reduction 4 with 11 rules applied. Total rules applied 1638 place count 189 transition count 767
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1639 place count 189 transition count 766
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1645 place count 183 transition count 760
Iterating global reduction 5 with 6 rules applied. Total rules applied 1651 place count 183 transition count 760
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1652 place count 183 transition count 759
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1654 place count 181 transition count 757
Iterating global reduction 6 with 2 rules applied. Total rules applied 1656 place count 181 transition count 757
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1658 place count 179 transition count 755
Iterating global reduction 6 with 2 rules applied. Total rules applied 1660 place count 179 transition count 755
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1661 place count 179 transition count 754
Performed 38 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 7 with 76 rules applied. Total rules applied 1737 place count 141 transition count 714
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 1765 place count 113 transition count 269
Iterating global reduction 7 with 28 rules applied. Total rules applied 1793 place count 113 transition count 269
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1805 place count 113 transition count 257
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1820 place count 98 transition count 237
Iterating global reduction 8 with 15 rules applied. Total rules applied 1835 place count 98 transition count 237
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1850 place count 83 transition count 217
Iterating global reduction 8 with 15 rules applied. Total rules applied 1865 place count 83 transition count 217
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1871 place count 83 transition count 211
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 1889 place count 74 transition count 218
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1890 place count 73 transition count 208
Iterating global reduction 9 with 1 rules applied. Total rules applied 1891 place count 73 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1892 place count 73 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 1897 place count 73 transition count 202
Applied a total of 1897 rules in 85 ms. Remains 73 /1073 variables (removed 1000) and now considering 202/1672 (removed 1470) transitions.
[2024-05-29 13:04:30] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
// Phase 1: matrix 196 rows 73 cols
[2024-05-29 13:04:30] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 13:04:30] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 13:04:30] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
[2024-05-29 13:04:30] [INFO ] Invariant cache hit.
[2024-05-29 13:04:30] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 13:04:30] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-29 13:04:30] [INFO ] Redundant transitions in 3 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-29 13:04:30] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
[2024-05-29 13:04:30] [INFO ] Invariant cache hit.
[2024-05-29 13:04:30] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 13:04:31] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:04:31] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:04:31] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:04:31] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:04:31] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:04:31] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:04:31] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:04:31] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:04:31] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:04:32] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:04:32] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:04:32] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:04:32] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:04:32] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:04:32] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:04:32] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:04:32] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:04:32] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:04:32] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:04:32] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 13:04:33] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:04:33] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:04:33] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:04:33] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:04:33] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 13:04:33] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:04:34] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:04:34] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 0 ms to minimize.
[2024-05-29 13:04:34] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:04:34] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 13:04:34] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:04:34] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:04:34] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 195/268 variables, 73/108 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 30/138 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 1/269 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (OVERLAPS) 0/269 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 139 constraints, problems are : Problem set: 0 solved, 185 unsolved in 9294 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 195/268 variables, 73/108 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 30/138 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 185/323 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 13:04:48] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 13:04:51] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:04:51] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (OVERLAPS) 0/269 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 327 constraints, problems are : Problem set: 0 solved, 185 unsolved in 22671 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 36/36 constraints]
After SMT, in 32096ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 32101ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/1073 places, 202/1672 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32366 ms. Remains : 73/1073 places, 202/1672 transitions.
Stuttering acceptance computed with spot in 188 ms :[p1, p0, p0, p1]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLCardinality-07
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-04b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLCardinality-07 finished in 32573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1073 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1073/1073 places, 1672/1672 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1061 transition count 1660
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1061 transition count 1660
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 1050 transition count 1649
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 1050 transition count 1649
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1050 transition count 1648
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 1040 transition count 1638
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 1040 transition count 1638
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 1031 transition count 1629
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 1031 transition count 1629
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 92 place count 1024 transition count 1622
Iterating global reduction 1 with 7 rules applied. Total rules applied 99 place count 1024 transition count 1622
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 106 place count 1017 transition count 1615
Iterating global reduction 1 with 7 rules applied. Total rules applied 113 place count 1017 transition count 1615
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 120 place count 1010 transition count 1608
Iterating global reduction 1 with 7 rules applied. Total rules applied 127 place count 1010 transition count 1608
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 129 place count 1010 transition count 1606
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 133 place count 1006 transition count 1602
Iterating global reduction 2 with 4 rules applied. Total rules applied 137 place count 1006 transition count 1602
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 1003 transition count 1599
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 1003 transition count 1599
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 1003 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 1001 transition count 1596
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 1001 transition count 1596
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 150 place count 999 transition count 1594
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 999 transition count 1594
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 154 place count 997 transition count 1592
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 997 transition count 1592
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 995 transition count 1590
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 995 transition count 1590
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 162 place count 993 transition count 1588
Iterating global reduction 3 with 2 rules applied. Total rules applied 164 place count 993 transition count 1588
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 165 place count 993 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 166 place count 992 transition count 1586
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 992 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 168 place count 991 transition count 1585
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 991 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 170 place count 990 transition count 1584
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 990 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 172 place count 989 transition count 1583
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 989 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 174 place count 988 transition count 1582
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 988 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 176 place count 987 transition count 1581
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 987 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 178 place count 986 transition count 1580
Iterating global reduction 4 with 1 rules applied. Total rules applied 179 place count 986 transition count 1580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 180 place count 986 transition count 1579
Applied a total of 180 rules in 665 ms. Remains 986 /1073 variables (removed 87) and now considering 1579/1672 (removed 93) transitions.
// Phase 1: matrix 1579 rows 986 cols
[2024-05-29 13:05:03] [INFO ] Computed 6 invariants in 16 ms
[2024-05-29 13:05:03] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-29 13:05:03] [INFO ] Invariant cache hit.
[2024-05-29 13:05:04] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
Running 1578 sub problems to find dead transitions.
[2024-05-29 13:05:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/985 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1578 unsolved
SMT process timed out in 32150ms, After SMT, problems are : Problem set: 0 solved, 1578 unsolved
Search for dead transitions found 0 dead transitions in 32168ms
Starting structural reductions in LTL mode, iteration 1 : 986/1073 places, 1579/1672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33936 ms. Remains : 986/1073 places, 1579/1672 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-04b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLCardinality-09 finished in 34063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1073 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1073/1073 places, 1672/1672 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1062 transition count 1661
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1062 transition count 1661
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 1052 transition count 1651
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 1052 transition count 1651
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1052 transition count 1650
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 1043 transition count 1641
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 1043 transition count 1641
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 1034 transition count 1632
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 1034 transition count 1632
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 86 place count 1027 transition count 1625
Iterating global reduction 1 with 7 rules applied. Total rules applied 93 place count 1027 transition count 1625
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 1027 transition count 1624
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 1021 transition count 1618
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 1021 transition count 1618
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 1015 transition count 1612
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 1015 transition count 1612
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 1015 transition count 1610
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 1012 transition count 1607
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 1012 transition count 1607
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 1010 transition count 1605
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 1010 transition count 1605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 1010 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 1009 transition count 1603
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 1009 transition count 1603
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 1008 transition count 1602
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 1008 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 1007 transition count 1601
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 1007 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 1006 transition count 1600
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 1006 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 1005 transition count 1599
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 1005 transition count 1599
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 142 place count 1005 transition count 1598
Applied a total of 142 rules in 420 ms. Remains 1005 /1073 variables (removed 68) and now considering 1598/1672 (removed 74) transitions.
// Phase 1: matrix 1598 rows 1005 cols
[2024-05-29 13:05:37] [INFO ] Computed 6 invariants in 20 ms
[2024-05-29 13:05:37] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-29 13:05:37] [INFO ] Invariant cache hit.
[2024-05-29 13:05:38] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Running 1597 sub problems to find dead transitions.
[2024-05-29 13:05:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1004 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1597 unsolved
SMT process timed out in 32258ms, After SMT, problems are : Problem set: 0 solved, 1597 unsolved
Search for dead transitions found 0 dead transitions in 32276ms
Starting structural reductions in LTL mode, iteration 1 : 1005/1073 places, 1598/1672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33788 ms. Remains : 1005/1073 places, 1598/1672 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLCardinality-11 finished in 33922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p1))||p0)))'
Support contains 6 out of 1073 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1073/1073 places, 1672/1672 transitions.
Graph (trivial) has 1059 edges and 1073 vertex of which 85 / 1073 are part of one of the 15 SCC in 5 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 734 transitions
Trivial Post-agglo rules discarded 734 transitions
Performed 734 trivial Post agglomeration. Transition count delta: 734
Iterating post reduction 0 with 734 rules applied. Total rules applied 735 place count 1002 transition count 857
Reduce places removed 734 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 752 rules applied. Total rules applied 1487 place count 268 transition count 839
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 1496 place count 261 transition count 837
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1498 place count 259 transition count 837
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 1498 place count 259 transition count 781
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1610 place count 203 transition count 781
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1621 place count 192 transition count 770
Iterating global reduction 4 with 11 rules applied. Total rules applied 1632 place count 192 transition count 770
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1633 place count 192 transition count 769
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1639 place count 186 transition count 763
Iterating global reduction 5 with 6 rules applied. Total rules applied 1645 place count 186 transition count 763
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1646 place count 186 transition count 762
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1648 place count 184 transition count 760
Iterating global reduction 6 with 2 rules applied. Total rules applied 1650 place count 184 transition count 760
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1652 place count 182 transition count 758
Iterating global reduction 6 with 2 rules applied. Total rules applied 1654 place count 182 transition count 758
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 1732 place count 143 transition count 718
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 1760 place count 115 transition count 273
Iterating global reduction 6 with 28 rules applied. Total rules applied 1788 place count 115 transition count 273
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1802 place count 115 transition count 259
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1816 place count 101 transition count 241
Iterating global reduction 7 with 14 rules applied. Total rules applied 1830 place count 101 transition count 241
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1844 place count 87 transition count 223
Iterating global reduction 7 with 14 rules applied. Total rules applied 1858 place count 87 transition count 223
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1864 place count 87 transition count 217
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1882 place count 78 transition count 224
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1883 place count 77 transition count 213
Iterating global reduction 8 with 1 rules applied. Total rules applied 1884 place count 77 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1885 place count 77 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1891 place count 77 transition count 206
Applied a total of 1891 rules in 87 ms. Remains 77 /1073 variables (removed 996) and now considering 206/1672 (removed 1466) transitions.
[2024-05-29 13:06:10] [INFO ] Flow matrix only has 200 transitions (discarded 6 similar events)
// Phase 1: matrix 200 rows 77 cols
[2024-05-29 13:06:10] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 13:06:11] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 13:06:11] [INFO ] Flow matrix only has 200 transitions (discarded 6 similar events)
[2024-05-29 13:06:11] [INFO ] Invariant cache hit.
[2024-05-29 13:06:11] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 13:06:11] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-29 13:06:11] [INFO ] Redundant transitions in 2 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-29 13:06:11] [INFO ] Flow matrix only has 200 transitions (discarded 6 similar events)
[2024-05-29 13:06:11] [INFO ] Invariant cache hit.
[2024-05-29 13:06:11] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:06:13] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:06:13] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 0 ms to minimize.
[2024-05-29 13:06:13] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:06:13] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:06:13] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:06:13] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:06:14] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:06:14] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:06:14] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:06:14] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:06:14] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:06:14] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:06:14] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:06:14] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:06:14] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:06:14] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:06:14] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:06:15] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:06:15] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:06:15] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:06:15] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:06:15] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:06:15] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 199/276 variables, 77/117 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 30/147 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (OVERLAPS) 1/277 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (OVERLAPS) 0/277 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 148 constraints, problems are : Problem set: 0 solved, 189 unsolved in 9893 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 199/276 variables, 77/117 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 30/147 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 189/336 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:06:24] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 1/277 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:06:33] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:06:33] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (OVERLAPS) 0/277 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 340 constraints, problems are : Problem set: 0 solved, 189 unsolved in 23511 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 41/41 constraints]
After SMT, in 33527ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 33529ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/1073 places, 206/1672 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33810 ms. Remains : 77/1073 places, 206/1672 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLCardinality-12
Product exploration explored 100000 steps with 727 reset in 92 ms.
Product exploration explored 100000 steps with 10849 reset in 484 ms.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 253 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 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (4344 resets) in 1008 ms. (39 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (471 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
[2024-05-29 13:06:46] [INFO ] Flow matrix only has 200 transitions (discarded 6 similar events)
[2024-05-29 13:06:46] [INFO ] Invariant cache hit.
[2024-05-29 13:06:46] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 198/273 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 30/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/276 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/277 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/277 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:06:46] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:06:46] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 198/273 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 30/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/276 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/277 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:06:46] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/277 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 396ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 206/206 transitions.
Graph (complete) has 350 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 76 transition count 189
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 71 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 70 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 70 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 70 transition count 186
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 3 with 12 rules applied. Total rules applied 38 place count 64 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 63 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 63 transition count 179
Free-agglomeration rule applied 27 times.
Iterating global reduction 3 with 27 rules applied. Total rules applied 67 place count 63 transition count 152
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 50 rules applied. Total rules applied 117 place count 35 transition count 130
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 122 place count 30 transition count 130
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 127 place count 25 transition count 125
Iterating global reduction 5 with 5 rules applied. Total rules applied 132 place count 25 transition count 125
Performed 10 Post agglomeration using F-continuation condition with reduction of 52 identical transitions.
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 152 place count 15 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 172 place count 15 transition count 43
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 173 place count 14 transition count 42
Iterating global reduction 6 with 1 rules applied. Total rules applied 174 place count 14 transition count 42
Performed 4 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 184 place count 8 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 192 place count 8 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 193 place count 8 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 194 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 195 place count 6 transition count 6
Applied a total of 195 rules in 21 ms. Remains 6 /77 variables (removed 71) and now considering 6/206 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 6/77 places, 6/206 transitions.
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 125 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 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 206/206 transitions.
Applied a total of 0 rules in 7 ms. Remains 77 /77 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-29 13:06:46] [INFO ] Flow matrix only has 200 transitions (discarded 6 similar events)
[2024-05-29 13:06:46] [INFO ] Invariant cache hit.
[2024-05-29 13:06:46] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 13:06:46] [INFO ] Flow matrix only has 200 transitions (discarded 6 similar events)
[2024-05-29 13:06:46] [INFO ] Invariant cache hit.
[2024-05-29 13:06:46] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 13:06:46] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-29 13:06:46] [INFO ] Redundant transitions in 2 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-29 13:06:46] [INFO ] Flow matrix only has 200 transitions (discarded 6 similar events)
[2024-05-29 13:06:46] [INFO ] Invariant cache hit.
[2024-05-29 13:06:46] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:06:47] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:06:47] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:06:47] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:06:47] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:06:48] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:06:49] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:06:49] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:06:49] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:06:49] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:06:49] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:06:49] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:06:49] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:06:50] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:06:50] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:06:50] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:06:50] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:06:50] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:06:50] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:06:50] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:06:50] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:06:50] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:06:51] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:06:51] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:06:51] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:06:51] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 199/276 variables, 77/117 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 30/147 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (OVERLAPS) 1/277 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (OVERLAPS) 0/277 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 148 constraints, problems are : Problem set: 0 solved, 189 unsolved in 10091 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 199/276 variables, 77/117 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 30/147 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 189/336 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:07:00] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 1/277 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:07:09] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:07:10] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (OVERLAPS) 0/277 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 340 constraints, problems are : Problem set: 0 solved, 189 unsolved in 24548 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 41/41 constraints]
After SMT, in 34785ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 34788ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34968 ms. Remains : 77/77 places, 206/206 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (4368 resets) in 124 ms. (320 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (466 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
[2024-05-29 13:07:21] [INFO ] Flow matrix only has 200 transitions (discarded 6 similar events)
[2024-05-29 13:07:21] [INFO ] Invariant cache hit.
[2024-05-29 13:07:21] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 198/273 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 30/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/276 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/277 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/277 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:07:22] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:07:22] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 198/273 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 30/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/276 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/277 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:07:22] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/277 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 383ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 206/206 transitions.
Graph (complete) has 350 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 76 transition count 189
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 71 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 70 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 70 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 70 transition count 186
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 38 place count 64 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 63 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 63 transition count 179
Free-agglomeration rule applied 27 times.
Iterating global reduction 3 with 27 rules applied. Total rules applied 67 place count 63 transition count 152
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 50 rules applied. Total rules applied 117 place count 35 transition count 130
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 122 place count 30 transition count 130
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 127 place count 25 transition count 125
Iterating global reduction 5 with 5 rules applied. Total rules applied 132 place count 25 transition count 125
Performed 10 Post agglomeration using F-continuation condition with reduction of 52 identical transitions.
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 152 place count 15 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 172 place count 15 transition count 43
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 173 place count 14 transition count 42
Iterating global reduction 6 with 1 rules applied. Total rules applied 174 place count 14 transition count 42
Performed 4 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 184 place count 8 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 192 place count 8 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 193 place count 8 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 194 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 195 place count 6 transition count 6
Applied a total of 195 rules in 28 ms. Remains 6 /77 variables (removed 71) and now considering 6/206 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 6/77 places, 6/206 transitions.
RANDOM walk for 43 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 123 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 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5314 reset in 94 ms.
Product exploration explored 100000 steps with 4431 reset in 95 ms.
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 206/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-29 13:07:22] [INFO ] Flow matrix only has 200 transitions (discarded 6 similar events)
[2024-05-29 13:07:22] [INFO ] Invariant cache hit.
[2024-05-29 13:07:23] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 13:07:23] [INFO ] Flow matrix only has 200 transitions (discarded 6 similar events)
[2024-05-29 13:07:23] [INFO ] Invariant cache hit.
[2024-05-29 13:07:23] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 13:07:23] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-29 13:07:23] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-29 13:07:23] [INFO ] Flow matrix only has 200 transitions (discarded 6 similar events)
[2024-05-29 13:07:23] [INFO ] Invariant cache hit.
[2024-05-29 13:07:23] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:07:24] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:07:24] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:07:24] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:07:24] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:07:24] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:07:24] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:07:24] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:07:24] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:07:24] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:07:24] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:07:24] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:07:24] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:07:25] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:07:25] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:07:25] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:07:25] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:07:25] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:07:25] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:07:25] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:07:25] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:07:25] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-29 13:07:26] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:07:26] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:07:26] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:07:26] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:07:26] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:07:26] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:07:26] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:07:26] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:07:27] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:07:27] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:07:27] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:07:27] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:07:27] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:07:27] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:07:27] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:07:27] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:07:27] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 199/276 variables, 77/117 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 30/147 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (OVERLAPS) 1/277 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (OVERLAPS) 0/277 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 148 constraints, problems are : Problem set: 0 solved, 189 unsolved in 10264 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 199/276 variables, 77/117 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 30/147 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 189/336 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:07:37] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 1/277 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:07:46] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:07:46] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (OVERLAPS) 0/277 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 340 constraints, problems are : Problem set: 0 solved, 189 unsolved in 24086 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 41/41 constraints]
After SMT, in 34506ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 34509ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34703 ms. Remains : 77/77 places, 206/206 transitions.
Treatment of property StigmergyCommit-PT-04b-LTLCardinality-12 finished in 106977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1073 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1073/1073 places, 1672/1672 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1062 transition count 1661
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1062 transition count 1661
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 1052 transition count 1651
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 1052 transition count 1651
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1052 transition count 1650
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 1043 transition count 1641
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 1043 transition count 1641
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 1034 transition count 1632
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 1034 transition count 1632
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 87 place count 1026 transition count 1624
Iterating global reduction 1 with 8 rules applied. Total rules applied 95 place count 1026 transition count 1624
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 1026 transition count 1623
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 103 place count 1019 transition count 1616
Iterating global reduction 2 with 7 rules applied. Total rules applied 110 place count 1019 transition count 1616
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 117 place count 1012 transition count 1609
Iterating global reduction 2 with 7 rules applied. Total rules applied 124 place count 1012 transition count 1609
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 1012 transition count 1607
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 130 place count 1008 transition count 1603
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 1008 transition count 1603
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 137 place count 1005 transition count 1600
Iterating global reduction 3 with 3 rules applied. Total rules applied 140 place count 1005 transition count 1600
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 141 place count 1005 transition count 1599
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 143 place count 1003 transition count 1597
Iterating global reduction 4 with 2 rules applied. Total rules applied 145 place count 1003 transition count 1597
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 147 place count 1001 transition count 1595
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 1001 transition count 1595
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 151 place count 999 transition count 1593
Iterating global reduction 4 with 2 rules applied. Total rules applied 153 place count 999 transition count 1593
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 155 place count 997 transition count 1591
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 997 transition count 1591
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 159 place count 995 transition count 1589
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 995 transition count 1589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 162 place count 995 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 163 place count 994 transition count 1587
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 994 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 165 place count 993 transition count 1586
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 993 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 167 place count 992 transition count 1585
Iterating global reduction 5 with 1 rules applied. Total rules applied 168 place count 992 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 169 place count 991 transition count 1584
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 991 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 171 place count 990 transition count 1583
Iterating global reduction 5 with 1 rules applied. Total rules applied 172 place count 990 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 173 place count 989 transition count 1582
Iterating global reduction 5 with 1 rules applied. Total rules applied 174 place count 989 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 175 place count 988 transition count 1581
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 988 transition count 1581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 177 place count 988 transition count 1580
Applied a total of 177 rules in 648 ms. Remains 988 /1073 variables (removed 85) and now considering 1580/1672 (removed 92) transitions.
// Phase 1: matrix 1580 rows 988 cols
[2024-05-29 13:07:58] [INFO ] Computed 6 invariants in 19 ms
[2024-05-29 13:07:58] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-29 13:07:58] [INFO ] Invariant cache hit.
[2024-05-29 13:07:59] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
Running 1579 sub problems to find dead transitions.
[2024-05-29 13:07:59] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/987 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1579 unsolved
SMT process timed out in 32018ms, After SMT, problems are : Problem set: 0 solved, 1579 unsolved
Search for dead transitions found 0 dead transitions in 32033ms
Starting structural reductions in LTL mode, iteration 1 : 988/1073 places, 1580/1672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33833 ms. Remains : 988/1073 places, 1580/1672 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLCardinality-13
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-04b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLCardinality-13 finished in 33954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 1073 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1073/1073 places, 1672/1672 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1062 transition count 1661
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1062 transition count 1661
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 1052 transition count 1651
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 1052 transition count 1651
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1052 transition count 1650
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 1043 transition count 1641
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 1043 transition count 1641
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 1034 transition count 1632
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 1034 transition count 1632
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 86 place count 1027 transition count 1625
Iterating global reduction 1 with 7 rules applied. Total rules applied 93 place count 1027 transition count 1625
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 1027 transition count 1624
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 1021 transition count 1618
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 1021 transition count 1618
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 1015 transition count 1612
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 1015 transition count 1612
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 1015 transition count 1610
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 1012 transition count 1607
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 1012 transition count 1607
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 1010 transition count 1605
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 1010 transition count 1605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 1010 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 1009 transition count 1603
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 1009 transition count 1603
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 1008 transition count 1602
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 1008 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 1007 transition count 1601
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 1007 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 1006 transition count 1600
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 1006 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 1005 transition count 1599
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 1005 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 1004 transition count 1598
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 1004 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 144 place count 1003 transition count 1597
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 1003 transition count 1597
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 1002 transition count 1596
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 1002 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 1001 transition count 1595
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 1001 transition count 1595
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 150 place count 1000 transition count 1594
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 1000 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 152 place count 999 transition count 1593
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 999 transition count 1593
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 154 place count 998 transition count 1592
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 998 transition count 1592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 156 place count 998 transition count 1591
Applied a total of 156 rules in 620 ms. Remains 998 /1073 variables (removed 75) and now considering 1591/1672 (removed 81) transitions.
// Phase 1: matrix 1591 rows 998 cols
[2024-05-29 13:08:32] [INFO ] Computed 6 invariants in 16 ms
[2024-05-29 13:08:32] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-29 13:08:32] [INFO ] Invariant cache hit.
[2024-05-29 13:08:33] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
Running 1590 sub problems to find dead transitions.
[2024-05-29 13:08:33] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
SMT process timed out in 32085ms, After SMT, problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 32101ms
Starting structural reductions in LTL mode, iteration 1 : 998/1073 places, 1591/1672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33795 ms. Remains : 998/1073 places, 1591/1672 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 411 ms.
Product exploration explored 100000 steps with 50000 reset in 281 ms.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-04b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-04b-LTLCardinality-15 finished in 34632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p1))||p0)))'
[2024-05-29 13:09:06] [INFO ] Flatten gal took : 78 ms
[2024-05-29 13:09:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-29 13:09:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1073 places, 1672 transitions and 7653 arcs took 13 ms.
Total runtime 437479 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyCommit-PT-04b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1073
TRANSITIONS: 1672
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.038s, Sys 0.003s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1720
MODEL NAME: /home/mcc/execution/418/model
1073 places, 1672 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyCommit-PT-04b-LTLCardinality-12 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716988570164

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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="StigmergyCommit-PT-04b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is StigmergyCommit-PT-04b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690529700131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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