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.r136-tall-171631132500371.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 itstools
Input is DiscoveryGPU-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132500371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 02:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 12 02:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 46K May 18 16:42 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 DiscoveryGPU-PT-06b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716374253249

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 10:37:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 10:37:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:37:34] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-22 10:37:34] [INFO ] Transformed 184 places.
[2024-05-22 10:37:34] [INFO ] Transformed 194 transitions.
[2024-05-22 10:37:34] [INFO ] Found NUPN structural information;
[2024-05-22 10:37:34] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 172 transition count 194
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 39 place count 145 transition count 167
Iterating global reduction 1 with 27 rules applied. Total rules applied 66 place count 145 transition count 167
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 140 transition count 162
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 140 transition count 162
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 137 transition count 159
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 137 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 134 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 134 transition count 156
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 132 transition count 152
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 132 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 130 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 130 transition count 150
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 128 transition count 148
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 128 transition count 148
Applied a total of 100 rules in 65 ms. Remains 128 /184 variables (removed 56) and now considering 148/194 (removed 46) transitions.
// Phase 1: matrix 148 rows 128 cols
[2024-05-22 10:37:34] [INFO ] Computed 2 invariants in 14 ms
[2024-05-22 10:37:34] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-22 10:37:34] [INFO ] Invariant cache hit.
[2024-05-22 10:37:35] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-22 10:37:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/276 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 10:37:37] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 14 ms to minimize.
[2024-05-22 10:37:37] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-22 10:37:37] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-22 10:37:37] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-05-22 10:37:37] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 10:37:37] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-22 10:37:37] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2024-05-22 10:37:37] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-22 10:37:37] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-22 10:37:37] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-22 10:37:37] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:37:37] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:37:37] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 13/143 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 143 constraints, problems are : Problem set: 0 solved, 147 unsolved in 5058 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/276 variables, 128/143 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 147/290 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 290 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4579 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 13/13 constraints]
After SMT, in 9730ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 9753ms
Starting structural reductions in LTL mode, iteration 1 : 128/184 places, 148/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10203 ms. Remains : 128/184 places, 148/194 transitions.
Support contains 19 out of 128 places after structural reductions.
[2024-05-22 10:37:45] [INFO ] Flatten gal took : 31 ms
[2024-05-22 10:37:45] [INFO ] Flatten gal took : 16 ms
[2024-05-22 10:37:45] [INFO ] Input system was already deterministic with 148 transitions.
RANDOM walk for 3281 steps (15 resets) in 133 ms. (24 steps per ms) remains 0/10 properties
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 248 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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(F(p0)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 148/148 transitions.
Graph (complete) has 248 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 125 transition count 125
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 105 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 103 transition count 123
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 45 place count 103 transition count 105
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 81 place count 85 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 85 place count 81 transition count 101
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 81 transition count 101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 89 place count 81 transition count 99
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 79 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 78 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 78 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 77 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 77 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 76 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 76 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 75 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 75 transition count 94
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 155 place count 48 transition count 67
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 160 place count 43 transition count 58
Iterating global reduction 3 with 5 rules applied. Total rules applied 165 place count 43 transition count 58
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 170 place count 38 transition count 51
Iterating global reduction 3 with 5 rules applied. Total rules applied 175 place count 38 transition count 51
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 180 place count 33 transition count 42
Iterating global reduction 3 with 5 rules applied. Total rules applied 185 place count 33 transition count 42
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 189 place count 29 transition count 37
Iterating global reduction 3 with 4 rules applied. Total rules applied 193 place count 29 transition count 37
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 196 place count 26 transition count 32
Iterating global reduction 3 with 3 rules applied. Total rules applied 199 place count 26 transition count 32
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 202 place count 23 transition count 28
Iterating global reduction 3 with 3 rules applied. Total rules applied 205 place count 23 transition count 28
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 22 transition count 27
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 22 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 208 place count 22 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 210 place count 20 transition count 24
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 15 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 217 place count 13 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 217 place count 13 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 12 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 11 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 10 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 10 transition count 15
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 228 place count 7 transition count 12
Applied a total of 228 rules in 38 ms. Remains 7 /128 variables (removed 121) and now considering 12/148 (removed 136) transitions.
[2024-05-22 10:37:45] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 7 cols
[2024-05-22 10:37:45] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 10:37:45] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-22 10:37:45] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2024-05-22 10:37:45] [INFO ] Invariant cache hit.
[2024-05-22 10:37:45] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-22 10:37:45] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-22 10:37:45] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2024-05-22 10:37:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/16 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 110ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/128 places, 12/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 7/128 places, 12/148 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-00 finished in 455 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(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 148/148 transitions.
Graph (complete) has 248 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 125 transition count 125
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 105 transition count 125
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 41 place count 105 transition count 107
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 77 place count 87 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 84 transition count 104
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 84 transition count 104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 83 place count 84 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 83 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 82 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 82 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 81 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 81 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 80 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 80 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 79 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 79 transition count 98
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 151 place count 50 transition count 69
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 156 place count 45 transition count 60
Iterating global reduction 2 with 5 rules applied. Total rules applied 161 place count 45 transition count 60
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 166 place count 40 transition count 53
Iterating global reduction 2 with 5 rules applied. Total rules applied 171 place count 40 transition count 53
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 176 place count 35 transition count 44
Iterating global reduction 2 with 5 rules applied. Total rules applied 181 place count 35 transition count 44
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 186 place count 30 transition count 38
Iterating global reduction 2 with 5 rules applied. Total rules applied 191 place count 30 transition count 38
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 26 transition count 31
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 26 transition count 31
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 202 place count 23 transition count 27
Iterating global reduction 2 with 3 rules applied. Total rules applied 205 place count 23 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 206 place count 22 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 207 place count 22 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 208 place count 22 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 210 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 212 place count 19 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 213 place count 18 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 213 place count 18 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 217 place count 16 transition count 20
Applied a total of 217 rules in 37 ms. Remains 16 /128 variables (removed 112) and now considering 20/148 (removed 128) transitions.
[2024-05-22 10:37:45] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 16 cols
[2024-05-22 10:37:45] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 10:37:45] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-22 10:37:45] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-22 10:37:45] [INFO ] Invariant cache hit.
[2024-05-22 10:37:45] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 10:37:45] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-22 10:37:45] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-22 10:37:45] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-22 10:37:45] [INFO ] Invariant cache hit.
[2024-05-22 10:37:45] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 18/34 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/35 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 31 constraints, problems are : Problem set: 0 solved, 19 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 18/34 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 50 constraints, problems are : Problem set: 0 solved, 19 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 329ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 330ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/128 places, 20/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 16/128 places, 20/148 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-01
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-01 finished in 588 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(F(p0)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 148/148 transitions.
Graph (complete) has 248 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 125 transition count 125
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 105 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 104 transition count 124
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 43 place count 104 transition count 106
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 79 place count 86 transition count 106
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 82 transition count 102
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 82 transition count 102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 87 place count 82 transition count 100
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 80 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 79 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 79 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 78 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 78 transition count 98
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 153 place count 49 transition count 69
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 156 place count 46 transition count 64
Iterating global reduction 3 with 3 rules applied. Total rules applied 159 place count 46 transition count 64
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 43 transition count 60
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 43 transition count 60
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 168 place count 40 transition count 54
Iterating global reduction 3 with 3 rules applied. Total rules applied 171 place count 40 transition count 54
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 174 place count 37 transition count 51
Iterating global reduction 3 with 3 rules applied. Total rules applied 177 place count 37 transition count 51
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 180 place count 34 transition count 45
Iterating global reduction 3 with 3 rules applied. Total rules applied 183 place count 34 transition count 45
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 31 transition count 42
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 31 transition count 42
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 190 place count 30 transition count 40
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 30 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 192 place count 29 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 193 place count 29 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 195 place count 29 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 27 transition count 35
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 31 edges and 25 vertex of which 22 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 3 with 9 rules applied. Total rules applied 206 place count 22 transition count 26
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 213 place count 16 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 219 place count 13 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 13 transition count 21
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 223 place count 10 transition count 18
Applied a total of 223 rules in 35 ms. Remains 10 /128 variables (removed 118) and now considering 18/148 (removed 130) transitions.
[2024-05-22 10:37:46] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
// Phase 1: matrix 13 rows 10 cols
[2024-05-22 10:37:46] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:37:46] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-22 10:37:46] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
[2024-05-22 10:37:46] [INFO ] Invariant cache hit.
[2024-05-22 10:37:46] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-22 10:37:46] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-22 10:37:46] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
[2024-05-22 10:37:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/22 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 10 constraints, problems are : Problem set: 0 solved, 10 unsolved in 75 ms.
Refiners :[State Equation: 10/10 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 5/22 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 57 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 136ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/128 places, 18/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 213 ms. Remains : 10/128 places, 18/148 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-07 finished in 292 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(X(G((p0 U (p1&&F(G(p1))))))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 148/148 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 122 transition count 142
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 122 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 119 transition count 139
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 119 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 117 transition count 137
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 117 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 115 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 115 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 114 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 114 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 113 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 113 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 112 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 112 transition count 130
Applied a total of 32 rules in 15 ms. Remains 112 /128 variables (removed 16) and now considering 130/148 (removed 18) transitions.
// Phase 1: matrix 130 rows 112 cols
[2024-05-22 10:37:46] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 10:37:46] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 10:37:46] [INFO ] Invariant cache hit.
[2024-05-22 10:37:46] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-05-22 10:37:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 130/242 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-22 10:37:48] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-22 10:37:48] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:37:48] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-22 10:37:48] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:37:48] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:37:48] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:37:48] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 121 constraints, problems are : Problem set: 0 solved, 129 unsolved in 3260 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/242 variables, 112/121 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 129/250 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 250 constraints, problems are : Problem set: 0 solved, 129 unsolved in 3517 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 7/7 constraints]
After SMT, in 6808ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 6809ms
Starting structural reductions in LTL mode, iteration 1 : 112/128 places, 130/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6952 ms. Remains : 112/128 places, 130/148 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 4617 steps with 22 reset in 34 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-08 finished in 7205 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 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 148/148 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 121 transition count 141
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 121 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 118 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 118 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 116 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 116 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 114 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 114 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 113 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 113 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 112 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 112 transition count 130
Applied a total of 32 rules in 8 ms. Remains 112 /128 variables (removed 16) and now considering 130/148 (removed 18) transitions.
// Phase 1: matrix 130 rows 112 cols
[2024-05-22 10:37:53] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:37:53] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 10:37:53] [INFO ] Invariant cache hit.
[2024-05-22 10:37:54] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-05-22 10:37:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 130/242 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-22 10:37:55] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:37:55] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
[2024-05-22 10:37:55] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:37:55] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:37:55] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:37:55] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:37:55] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:37:55] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 122 constraints, problems are : Problem set: 0 solved, 129 unsolved in 3277 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/242 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 129/251 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 251 constraints, problems are : Problem set: 0 solved, 129 unsolved in 3320 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
After SMT, in 6627ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 6629ms
Starting structural reductions in LTL mode, iteration 1 : 112/128 places, 130/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6785 ms. Remains : 112/128 places, 130/148 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 679 steps with 3 reset in 7 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-09 finished in 6912 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 U (p1||G(p0))))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 148/148 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 122 transition count 142
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 122 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 119 transition count 138
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 119 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 117 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 117 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 115 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 115 transition count 134
Applied a total of 26 rules in 5 ms. Remains 115 /128 variables (removed 13) and now considering 134/148 (removed 14) transitions.
// Phase 1: matrix 134 rows 115 cols
[2024-05-22 10:38:00] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:38:00] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 10:38:00] [INFO ] Invariant cache hit.
[2024-05-22 10:38:00] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2024-05-22 10:38:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/249 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-22 10:38:02] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:38:02] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:38:02] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:38:02] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:38:02] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:38:02] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:38:02] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:38:02] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:38:02] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:38:02] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:38:02] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 11/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 128 constraints, problems are : Problem set: 0 solved, 133 unsolved in 3531 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/249 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 133/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 261 constraints, problems are : Problem set: 0 solved, 133 unsolved in 3370 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 11/11 constraints]
After SMT, in 6930ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 6932ms
Starting structural reductions in LTL mode, iteration 1 : 115/128 places, 134/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7061 ms. Remains : 115/128 places, 134/148 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-11
Product exploration explored 100000 steps with 1176 reset in 312 ms.
Stack based approach found an accepted trace after 61369 steps with 729 reset with depth 134 and stack size 131 in 113 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-11 finished in 7587 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(X(F(p0))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 148/148 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 120 transition count 140
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 120 transition count 140
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 116 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 116 transition count 135
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 113 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 113 transition count 132
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 110 transition count 128
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 110 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 108 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 106 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 105 transition count 122
Applied a total of 46 rules in 13 ms. Remains 105 /128 variables (removed 23) and now considering 122/148 (removed 26) transitions.
// Phase 1: matrix 122 rows 105 cols
[2024-05-22 10:38:08] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 10:38:08] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 10:38:08] [INFO ] Invariant cache hit.
[2024-05-22 10:38:08] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-22 10:38:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-22 10:38:09] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:38:09] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:38:09] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-22 10:38:09] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:38:09] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:38:09] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:38:09] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:38:09] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 115 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2981 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 236 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2979 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
After SMT, in 5995ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 5997ms
Starting structural reductions in LTL mode, iteration 1 : 105/128 places, 122/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6131 ms. Remains : 105/128 places, 122/148 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 68 ms.
Product exploration explored 100000 steps with 33333 reset in 101 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 210 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Detected a total of 20/105 stabilizing places and 20/122 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-15 finished in 6477 ms.
All properties solved by simple procedures.
Total runtime 40493 ms.

BK_STOP 1716374294911

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-06b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-06b, 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 r136-tall-171631132500371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06b.tgz
mv DiscoveryGPU-PT-06b 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 ;